- 博客(12)
- 收藏
- 关注
RSS订阅原创 POJ 3997 Stock Chase
Stock ChaseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 455 Accepted: 131DescriptionI have to admit, the solution I proposed last year for solving the
2013-09-26 15:25:08
1027
原创 POJ 3992 Tiles of Tetris, NOT!
Tiles of Tetris, NOT!Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 408 Accepted: 161DescriptionYou’ve really messed up this time. “Go buy some square
2013-09-26 13:44:50
1808
原创 POJ 3993 Not So Flat After All
Not So Flat After AllTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 356 Accepted: 151DescriptionAny positive integer v can be written as p1a1*p2a2*...*
2013-09-26 13:40:08
1254
原创 POJ 3996 Air Strike
Air StrikeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 389 Accepted: 130DescriptionGeneral Gee is the commander of a military base. He has just recei
2013-09-26 13:34:28
1221
原创 POJ 3991 Seinfeld
SeinfeldTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 897 Accepted: 440DescriptionI’m out of stories. For years I’ve been writing stories, some rather
2013-09-25 23:08:40
1182
原创 HDU 4046 Panda （ACM ICPC 2011北京赛区网络赛）
HDU 4046 Panda （模拟题 ACM ICPC 2011亚洲北京赛区网络赛）PandaTime Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1816 Accepted Submission(s): 6
2013-09-10 22:53:01
1269
原创 HDU 4041 Eliminate Witches! （ACM ICPC 2011北京赛区网络赛）
HDU 4041 Eliminate Witches! （模拟题 ACM ICPC 2011 亚洲北京赛区网络赛题目） Eliminate Witches!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 863 Acc
2013-09-10 15:55:02
1271
原创 HDU 4055 Number String （dp的思想）
Number StringTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1052 Accepted Submission(s): 456Problem DescriptionThe sign
2013-09-09 21:30:41
912
原创 POJ 3415 Max Sum of Max-K-sub-sequence （线段树+dp思想）
Max Sum of Max-K-sub-sequencePOJ 3415 Max Sum of Max-K-sub-sequence （线段树+dp思想）题目大意：T 组数据，求 n 个数 连续子串的最大和是多少，子串要求长度不超过 k，以及这是个环形，如果多解，满足起点be最小，其次终点en最小解题思路：枚举每个起点be，终点en一定是在 be<=en<=be+k-1 这个范围内，所以求这个范围内的连续最长和即可，可以用 sum[en] -sum[be-1] ，其中sum[x]表示前x个数的和，
2013-09-04 21:42:38
1058
原创 POJ 4003 Bob’s Race && HDU4123 Bob’s Race （dfs+rmq）
POJ 4003 && hdu 4123 Bob’s Race #include #include #include #include #include #include using namespace std;const int maxn=100010;struct edge{ int u,v,w; int next; ed
2013-09-02 20:41:04
1105
原创 HDU 3607 Traversal （线段树）
TraversalTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 899 Accepted Submission(s): 320Problem DescriptionXiao Ming is trave
2013-09-01 15:22:09
924
原创 HDU 2227 Find the nondecreasing subsequences （线段树）
Find the nondecreasing subsequencesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1235 Accepted Submission(s): 431Problem Descr
2013-09-01 14:22:52
870
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人