2012年8月15日

HDU 1542 Atlantis(矩形面积并)

摘要: AtlantisTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3469Accepted Submission(s): 1549Problem DescriptionThere are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts 阅读全文

posted @ 2012-08-15 22:00 kuangbin 阅读(1234) 评论(0) 推荐(0) 编辑

HDU 1255 覆盖的面积(矩形面积交)

摘要: 覆盖的面积Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2304Accepted Submission(s): 1136Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.Input输入数据的第一行是一个正整数T(1<=T<=100),代表测试数据的数量.每个测试数据的第一行是一个正整数N(1<=N<=1000),代表矩形的数量,然后是N行数据,每一行包含四个浮点数,代 阅读全文

posted @ 2012-08-15 21:59 kuangbin 阅读(3876) 评论(0) 推荐(0) 编辑

HDU 1540 Tunnel Warfare(线段树,去最大连续区间)

摘要: Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2396Accepted Submission(s): 886Problem DescriptionDuring the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally 阅读全文

posted @ 2012-08-15 21:55 kuangbin 阅读(4958) 评论(0) 推荐(2) 编辑

POJ 2063 Investment(完全背包)

摘要: InvestmentTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 5362Accepted: 1843DescriptionJohn never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John was the only in 阅读全文

posted @ 2012-08-15 11:53 kuangbin 阅读(646) 评论(1) 推荐(0) 编辑

HDU 1698 Just a Hook(线段树,成段更新)

摘要: Just a HookTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9258Accepted Submission(s): 4510Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecut 阅读全文

posted @ 2012-08-15 02:57 kuangbin 阅读(2448) 评论(0) 推荐(0) 编辑

HDU 1394 Minimum Inversion Number(求逆序数,线段树或者树状数组)

摘要: Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4647Accepted Submission(s): 2809Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai 阅读全文

posted @ 2012-08-15 02:11 kuangbin 阅读(3985) 评论(0) 推荐(1) 编辑

导航

JAVASCRIPT: