08 2015 档案

SPOJ - AMR11H
摘要:Array Diversity Time Limit: 404MS Memory Limit: 1572864KB 64bit IO Format: %lld & %llu Submit Status Description Here we go! Let's define the diversit 阅读全文

posted @ 2015-08-20 01:13 `Elaine 阅读(251) 评论(0) 推荐(0)

HDU-5074
摘要:Hatsune Miku Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 931 Accepted Submission(s): 651 Pr 阅读全文

posted @ 2015-08-19 02:28 `Elaine 阅读(215) 评论(0) 推荐(0)

UVALive - 5798
摘要:Jupiter Atacks! /** 题意:B,P,L,N,分别表示进制,mod,数组的个数,操作数 做法:树状数组 欧几里得 每个数加入到数组Tree的数是 B^(L-i) 用树状数组进行维护前缀和,然后求一段区间的数,除以B^(L-j) 因为(前缀和/B^(L-j)) 很大不好计算,所以就用乘 阅读全文

posted @ 2015-08-18 11:48 `Elaine 阅读(128) 评论(0) 推荐(0)

POJ-2195
摘要:Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19680 Accepted: 10003 Description On a grid map there are n little men and n hou 阅读全文

posted @ 2015-08-16 22:04 `Elaine 阅读(154) 评论(0) 推荐(0)

UVALive - 5844
摘要:题是pdf版 Sample Input23mississippinni55i55ippi2foobar|=o08arSample Output10 阅读全文

posted @ 2015-08-15 21:38 `Elaine 阅读(219) 评论(0) 推荐(0)

POJ-1556
摘要:The Doors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7105 Accepted: 2808 Description You are to find the length of the shortest path t 阅读全文

posted @ 2015-08-15 21:33 `Elaine 阅读(180) 评论(0) 推荐(0)

POJ-1410
摘要:Intersection Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12817 Accepted: 3343 Description You are to write a program that has to decide 阅读全文

posted @ 2015-08-15 21:29 `Elaine 阅读(388) 评论(0) 推荐(0)

HDU-5384
摘要:Danganronpa Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 210 Accepted Submission(s): 116 Pro 阅读全文

posted @ 2015-08-13 20:56 `Elaine 阅读(163) 评论(0) 推荐(0)

UVALive 5099
摘要:B - Nubulsa Expo Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Practice UVALive 5099 B - Nubulsa Expo Submit Status Pra 阅读全文

posted @ 2015-08-12 22:58 `Elaine 阅读(163) 评论(0) 推荐(0)

ZOJ-2753
摘要:Given an undirected graph, in which two vertexes can be connected by multiple edges, what is the min-cut of the graph? i.e. how many edges must be rem 阅读全文

posted @ 2015-08-12 22:56 `Elaine 阅读(152) 评论(0) 推荐(0)

HUD-5379
摘要:Mahjong tree Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 506 Accepted Submission(s): 161 Prob 阅读全文

posted @ 2015-08-11 22:56 `Elaine 阅读(139) 评论(0) 推荐(0)

HDU-5360
摘要:Hiking Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 76 Accepted Submission(s): 42Special Jud 阅读全文

posted @ 2015-08-06 18:28 `Elaine 阅读(193) 评论(0) 推荐(0)

HDU-5351
摘要:MZL's Border Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 671 Accepted Submission(s): 209 Prob 阅读全文

posted @ 2015-08-05 10:48 `Elaine 阅读(162) 评论(0) 推荐(0)

导航