2013年7月30日

HDU 4630 No Pain No Game（2013多校3 1010题 离线处理+树状数组求最值）

摘要： No Pain No GameTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17Accepted Submission(s): 5Problem DescriptionLife is a game,and you lose it,so you suicide.But you can not kill yourself before you solve this problem:Given you a sequence of number a1 阅读全文

posted @ 2013-07-30 17:27 kuangbin 阅读(1481) 评论(0) 推荐(0)

HDU 4631 Sad Love Story （2013多校3 1011题 平面最近点对+爆搞）

摘要： Sad Love StoryTime Limit: 40000/20000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 16Accepted Submission(s): 2Problem DescriptionThere's a really sad story.It could be about love or about money.But love will vanish and money will be corroded.These points will la 阅读全文

posted @ 2013-07-30 17:16 kuangbin 阅读(904) 评论(3) 推荐(2)

HDU 4417 Super Mario(划分树)

摘要： Super MarioTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1437Accepted Submission(s): 690Problem DescriptionMario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble a 阅读全文

posted @ 2013-07-30 09:52 kuangbin 阅读(1005) 评论(0) 推荐(0)

HDU 3473 Minimum Sum（划分树）

摘要： Minimum SumTime Limit: 16000/8000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2235Accepted Submission(s): 512Problem DescriptionYou are given N positive integers, denoted as x0, x1 ... xN-1. Then give you some intervals [l, r]. For each interval, you need to find a 阅读全文

posted @ 2013-07-30 09:51 kuangbin 阅读(862) 评论(0) 推荐(0)

导航

JAVASCRIPT: