季末Despair - 博客园

2016年8月5日

摘要：覆盖的面积 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Description 给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input 输入数据的第一行是一个正阅读全文

posted @ 2016-08-05 22:16 季末Despair 阅读(303) 评论(0) 推荐(0) 编辑

HDU 1542 Atlantis (求矩形面积并)

摘要： Atlantis Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Description There are several ancient Greek texts that conta 阅读全文

posted @ 2016-08-05 21:58 季末Despair 阅读(179) 评论(0) 推荐(0) 编辑

POJ 2299 Ultra-QuickSort (求逆序数：离散化+树状数组或者归并排序求逆序数)

摘要： Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 55048 Accepted: 20256 Description In this problem, you have to analyze a pa 阅读全文

posted @ 2016-08-05 19:51 季末Despair 阅读(197) 评论(0) 推荐(0) 编辑

2016年8月4日

UVaLive 3942 Remember the Word (dp+字典树)

摘要： Remember the Word DescriptionNeal is very curious about combinatorial problems, and now here comes a problem about words. Knowing that Ray has a photo 阅读全文

posted @ 2016-08-04 22:20 季末Despair 阅读(413) 评论(0) 推荐(0) 编辑

POJ 1056 IMMEDIATE DECODABILITY (字典树)

摘要： IMMEDIATE DECODABILITY Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12972 Accepted: 6222 Description An encoding of a set of symbols is 阅读全文

posted @ 2016-08-04 21:15 季末Despair 阅读(247) 评论(0) 推荐(0) 编辑

HDU 1671 Phone List (字典树)

摘要： Phone List Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Description Given a list of phone numbers, determine if it 阅读全文

posted @ 2016-08-04 21:12 季末Despair 阅读(226) 评论(0) 推荐(0) 编辑

HDU 1247 Hat’s Words (字典树)

摘要： Hat’s Words Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Description A hat’s word is a word in the dictionary that 阅读全文

posted @ 2016-08-04 21:02 季末Despair 阅读(166) 评论(0) 推荐(0) 编辑

UVa 11992 Fast Matrix Operations (线段树)

摘要： Fast Matrix Operations Description There is a matrix containing at most 106 elements divided into r rows and c columns. Each element has a location (x 阅读全文

posted @ 2016-08-04 00:09 季末Despair 阅读(198) 评论(0) 推荐(0) 编辑

2016年7月29日

UVALive - 4329 Ping pong (树状数组)

摘要： Ping pong Description N (3 ≤ N ≤ 20000) ping pong players live along a west-east street(consider the street as a line segment). Each player has a uniq 阅读全文

posted @ 2016-07-29 01:00 季末Despair 阅读(165) 评论(0) 推荐(0) 编辑

UVa 11997 K Smallest Sums (K路归并)

摘要： K Smallest Sums Description You’re given k arrays, each array has k integers. There are k k ways to pick exactly one element in each array and calcula 阅读全文

posted @ 2016-07-29 00:08 季末Despair 阅读(181) 评论(0) 推荐(0) 编辑

季末Despaire

公告