随笔分类 - A暑假集训
摘要:Anniversary party Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6926 Accepted: 3985 Description There is going to be a party to celebrate
阅读全文
摘要:Barbara Bennett's Wild Numbers Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 3153 Accepted: 1143 Description A wild number is a string co
阅读全文
摘要:windy数Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:165888KB 64bit IO Format:%lld & %llu Submit Status Description Input Outpu
阅读全文
摘要:Beautiful numbersCrawling in process... Crawling failed Time Limit:4000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Descriptio
阅读全文
摘要:Joint StacksCrawling in process... Crawling failed Time Limit:4000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 581
阅读全文
摘要:B-number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5008 Accepted Submission(s): 2872 Proble
阅读全文
摘要:X mod f(x) Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2792 Accepted Submission(s): 1101 Prob
阅读全文
摘要:Bomb Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 15102 Accepted Submission(s): 5452 Problem
阅读全文
摘要:不要62 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 34510 Accepted Submission(s): 12484 Problem
阅读全文
摘要:B - Chris and Road Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice
阅读全文
摘要:F - Mishka and trip Sample Output Hint In the first sample test: In Peter's first test, there's only one cycle with 1 vertex. First player cannot make
阅读全文
摘要:A - Spider Man Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Description
阅读全文
摘要:借鉴:http://www.cnblogs.com/xz816111/p/4809913.html
阅读全文
摘要:看了一个多星期状压DP,总算有点明白,大概可以分为两种:数据是在矩阵中的,数据是线性的,在矩阵中的一般就是排兵布阵这一种的,还有一种线性结构中给定条件让你求最大权值,比如求最大权值路线,TSP问题等,前一种的状态比较好想,一般就是有了第一行的状态然后推下一行的状态,i行的状态一般由i-1行的状态推出
阅读全文
摘要:八月一号的集训二十四号就来了......搬完宿舍之后就戳进实验室了,刚来的几天在耍ACMsteps,刚好回顾一下以前的知识,一回顾才发现以前理解是有多么的浅,比如背包问题,为什么循环那么循环?为什么那样就会求出最大值?没有平时那么多事的干扰,静下心来能思考不少事情,比如01背包为什么就逆向记忆,完全
阅读全文
摘要:NanoApe Loves Sequence Accepts: 531 Submissions: 2481 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others) Time Limit: 2
阅读全文
摘要:Price List Accepts: 880 Submissions: 2184 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others) Time Limit: 2000/1000 MS
阅读全文
摘要:sum Accepts: 640 Submissions: 1744 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Time Limit: 2000/1000 MS (Java/O
阅读全文
摘要:Travelling Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6600 Accepted Submission(s): 2144 Prob
阅读全文
摘要:Mondriaan's Dream Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 15295 Accepted: 8820 Description Squares and rectangles fascinated the fa
阅读全文

浙公网安备 33010602011771号