2012年8月30日

HDU 3635 Dragon Balls(并查集)

摘要: Dragon BallsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1201Accepted Submission(s): 484Problem DescriptionFive hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gath 阅读全文

posted @ 2012-08-30 21:04 kuangbin 阅读(2940) 评论(1) 推荐(2) 编辑

HDU 4302 Holedox Eating(优先队列或者线段树)

摘要: Holedox EatingTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1830Accepted Submission(s): 634Problem DescriptionHoledox is a small animal which can be considered as one point. It lives in a straight pipe whose length is L. Holedox can only move alo 阅读全文

posted @ 2012-08-30 19:27 kuangbin 阅读(1096) 评论(0) 推荐(0) 编辑

HDU 4301 Divide Chocolate(找规律,DP)

摘要: Divide ChocolateTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1061Accepted Submission(s): 505Problem DescriptionIt is well known that claire likes dessert very much, especially chocolate. But as a girl she also focuses on the intake of calories e 阅读全文

posted @ 2012-08-30 17:47 kuangbin 阅读(874) 评论(0) 推荐(0) 编辑

HDU 3530 Subsequence(单调队列)

摘要: SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2641Accepted Submission(s): 869Problem DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference betwee 阅读全文

posted @ 2012-08-30 16:00 kuangbin 阅读(1743) 评论(0) 推荐(0) 编辑

HDU 2594 Simpsons’ Hidden Talents(简单KMP)

摘要: Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 939Accepted Submission(s): 321Problem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: T 阅读全文

posted @ 2012-08-30 14:13 kuangbin 阅读(1160) 评论(0) 推荐(0) 编辑

HDU 3746 Cyclic Nacklace(KMP求循环节)

摘要: Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1255Accepted Submission(s): 538Problem DescriptionCC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are on 阅读全文

posted @ 2012-08-30 12:01 kuangbin 阅读(2621) 评论(1) 推荐(0) 编辑

HDU 3336 Count the string(KMP)

摘要: Count the stringTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2191Accepted Submission(s): 1038Problem DescriptionIt is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write dow 阅读全文

posted @ 2012-08-30 11:54 kuangbin 阅读(1191) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: