08 2016 档案

暑假集训总结
摘要：总结这一个暑假呐，就是被DP虐哭了的一个月，这TM就是一门玄学，没有一定的脑洞，怎么可能学好DP，用抽象的思维将一个大问题拆分成多个阶段决策问题，然后表示每个阶段的状态，再在每个状态之间进行决策的选择。题做多了之后才发现，DP的过程其实就是将状态你前面记录的过程记忆下来，然后后面你进行决策的时候以这 阅读全文
posted @ 2016-08-26 21:33 勿忘初心0924 阅读(394) 评论(0) 推荐(0) 编辑
poj 2486 Apple Tree(树形DP 状态方程有点难想)
摘要：Apple Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9808 Accepted: 3260 Description Wshxzt is a lovely girl. She likes apple very mu 阅读全文
posted @ 2016-08-25 16:00 勿忘初心0924 阅读(432) 评论(0) 推荐(0) 编辑
（纪念第一道完全自己想的树DP）CodeForces 219D Choosing Capital for Treeland
摘要：Choosing Capital for Treeland time limit per test 3 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standa 阅读全文
posted @ 2016-08-24 16:24 勿忘初心0924 阅读(200) 评论(0) 推荐(0) 编辑
暑假练习赛 007 E - Pairs
摘要：E - Pairs Description standard input/outputStatements In the secret book of ACM, it’s said: “Glory for those who write short ICPC problems. May they l 阅读全文
posted @ 2016-08-23 21:54 勿忘初心0924 阅读(225) 评论(0) 推荐(0) 编辑
暑假练习赛 007 C - OCR
摘要：C - OCR Description standard input/outputStatements Optical Character Recognition (OCR) is one of the most famous fields of Artificial Intelligence. T 阅读全文
posted @ 2016-08-23 21:50 勿忘初心0924 阅读(190) 评论(0) 推荐(0) 编辑
暑假练习赛 007 B - Weird Cryptography
摘要：Weird Cryptography Description standard input/outputStatements Khaled was sitting in the garden under an apple tree, suddenly! , well... you should gu 阅读全文
posted @ 2016-08-23 21:48 勿忘初心0924 阅读(158) 评论(0) 推荐(0) 编辑
暑假练习赛 007 A - Time
摘要：A - Time Description standard input/outputStatements A plane can go from city X to city Y in 1 hour and 20 minutes. However, when it returns from city 阅读全文
posted @ 2016-08-23 21:44 勿忘初心0924 阅读(216) 评论(0) 推荐(0) 编辑
poj 1155 TELE（树形DP）
摘要：TELE Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4863 Accepted: 2673 Description A TV-network plans to broadcast an important football 阅读全文
posted @ 2016-08-23 13:16 勿忘初心0924 阅读(196) 评论(0) 推荐(0) 编辑
hdu 4717 Tree2cycle(树形DP)
摘要：Tree2cycle Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 2161 Accepted Submission(s): 508 Pr 阅读全文
posted @ 2016-08-22 15:52 勿忘初心0924 阅读(194) 评论(0) 推荐(0) 编辑
hdu 2196 Computer(树形DP经典)
摘要：Computer Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5925 Accepted Submission(s): 2979 Proble 阅读全文
posted @ 2016-08-22 09:34 勿忘初心0924 阅读(339) 评论(0) 推荐(0) 编辑
暑假集训 周记 2
摘要：近一周的复习，用一个睡不醒就能概括，训练赛没状态，学新知识老是不明白，以前学的知识没学扎实，训练赛的一个模拟题，STL map+vector，竟然忘了map怎么用了......真是唉......树状DP方面，建树的几种方式基本了解，但是这都是表面的东西，重要的状态转移方程还是很难想，做一个题很矛盾， 阅读全文
posted @ 2016-08-21 17:46 勿忘初心0924 阅读(165) 评论(0) 推荐(0) 编辑
2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest J Cleaner Robot
摘要：Cleaner RobotCrawling in process... Crawling failed Time Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64u Submit Status Description In 阅读全文
posted @ 2016-08-20 20:01 勿忘初心0924 阅读(226) 评论(0) 推荐(0) 编辑
2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest I Lottery
摘要：LotteryCrawling in process... Crawling failed Time Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64u Submit Status Description Input Ou 阅读全文
posted @ 2016-08-20 19:54 勿忘初心0924 阅读(157) 评论(0) 推荐(0) 编辑
2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest A Email Aliases（模拟STL vector+map）
摘要：Email AliasesCrawling in process... Crawling failed Time Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64u Submit Status Description In 阅读全文
posted @ 2016-08-20 19:51 勿忘初心0924 阅读(208) 评论(0) 推荐(0) 编辑
HDU 4118 Holiday's Accommodation(树形DP)
摘要：Holiday's Accommodation Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 200000/200000 K (Java/Others)Total Submission(s): 2925 Accepted Submissio 阅读全文
posted @ 2016-08-19 16:35 勿忘初心0924 阅读(228) 评论(0) 推荐(0) 编辑
暑假练习赛 006 B Bear and Prime 100
摘要：Bear and Prime 100Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice 阅读全文
posted @ 2016-08-19 10:40 勿忘初心0924 阅读(127) 评论(0) 推荐(0) 编辑
暑假练习赛 006 E Vanya and Label（数学）
摘要：Vanya and LabelCrawling in process... Crawling failed Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice _ u 阅读全文
posted @ 2016-08-18 21:25 勿忘初心0924 阅读(158) 评论(0) 推荐(0) 编辑
暑假练习赛 006 A Vanya and Food Processor（模拟）
摘要：Description Vanya smashes potato in a vertical food processor. At each moment of time the height of the potato in the processor doesn't exceed h and t 阅读全文
posted @ 2016-08-18 21:21 勿忘初心0924 阅读(174) 评论(0) 推荐(0) 编辑
[转] 池子法 邻接表建图
摘要：#include #include #define Maxn 200 using namespace std; struct edge{int from,to,weight,next;}e[Maxn];//存储边信息的结构体 int head[Maxn];//起点为下标存储(e中边的位置) int main() { int edges;//边数 memset(... 阅读全文
posted @ 2016-08-18 17:02 勿忘初心0924 阅读(159) 评论(0) 推荐(0) 编辑
hdu 1011 Starship Troopers(树形DP入门)
摘要：Starship Troopers Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17498 Accepted Submission(s): 阅读全文
posted @ 2016-08-17 21:19 勿忘初心0924 阅读(248) 评论(0) 推荐(0) 编辑
hdu 1520 Anniversary party(入门树形DP)
摘要：Anniversary party Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6926 Accepted: 3985 Description There is going to be a party to celebrate 阅读全文
posted @ 2016-08-17 16:59 勿忘初心0924 阅读(162) 评论(0) 推荐(0) 编辑
poj 3340 Barbara Bennett's Wild Numbers(数位DP)
摘要：Barbara Bennett's Wild Numbers Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 3153 Accepted: 1143 Description A wild number is a string co 阅读全文
posted @ 2016-08-17 14:56 勿忘初心0924 阅读(233) 评论(0) 推荐(0) 编辑
windy数（数位DP）
摘要：windy数Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:165888KB 64bit IO Format:%lld & %llu Submit Status Description Input Outpu 阅读全文
posted @ 2016-08-12 15:13 勿忘初心0924 阅读(194) 评论(0) 推荐(0) 编辑
CF 55D - Beautiful numbers（数位DP）
摘要：Beautiful numbersCrawling in process... Crawling failed Time Limit:4000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Descriptio 阅读全文
posted @ 2016-08-12 13:45 勿忘初心0924 阅读(152) 评论(0) 推荐(0) 编辑
暑假练习赛 004 E Joint Stacks（优先队列模拟）
摘要：Joint StacksCrawling in process... Crawling failed Time Limit:4000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 581 阅读全文
posted @ 2016-08-11 21:08 勿忘初心0924 阅读(138) 评论(0) 推荐(0) 编辑
HDU 3652 B-number
摘要：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 阅读全文
posted @ 2016-08-11 15:53 勿忘初心0924 阅读(160) 评论(0) 推荐(0) 编辑
HDU X mod f(x)（题解注释）
摘要：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 阅读全文
posted @ 2016-08-11 10:25 勿忘初心0924 阅读(349) 评论(0) 推荐(0) 编辑
hdu 3555 Bomb(不要49，数位DP)
摘要：Bomb Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 15102 Accepted Submission(s): 5452 Problem 阅读全文
posted @ 2016-08-10 11:09 勿忘初心0924 阅读(1127) 评论(0) 推荐(0) 编辑
hdu 2089 不要62（入门数位dp）
摘要：不要62 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 34510 Accepted Submission(s): 12484 Problem 阅读全文
posted @ 2016-08-10 09:05 勿忘初心0924 阅读(213) 评论(0) 推荐(0) 编辑
暑假练习赛 003 B Chris and Road
摘要：B - Chris and Road Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice 阅读全文
posted @ 2016-08-09 21:34 勿忘初心0924 阅读(241) 评论(0) 推荐(0) 编辑
暑假练习赛 003 F Mishka and trip
摘要：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 阅读全文
posted @ 2016-08-09 21:12 勿忘初心0924 阅读(224) 评论(0) 推荐(0) 编辑
暑假练习赛 003 A Spider Man
摘要：A - Spider Man Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Description 阅读全文
posted @ 2016-08-09 21:09 勿忘初心0924 阅读(207) 评论(0) 推荐(0) 编辑
数位DP按位枚举模板
摘要：借鉴：http://www.cnblogs.com/xz816111/p/4809913.html 阅读全文
posted @ 2016-08-09 17:03 勿忘初心0924 阅读(509) 评论(0) 推荐(0) 编辑
状压DP小结
摘要：看了一个多星期状压DP，总算有点明白，大概可以分为两种：数据是在矩阵中的，数据是线性的，在矩阵中的一般就是排兵布阵这一种的，还有一种线性结构中给定条件让你求最大权值，比如求最大权值路线，TSP问题等，前一种的状态比较好想，一般就是有了第一行的状态然后推下一行的状态，i行的状态一般由i-1行的状态推出 阅读全文
posted @ 2016-08-09 15:47 勿忘初心0924 阅读(147) 评论(0) 推荐(0) 编辑
暑假集训 周记 1
摘要：八月一号的集训二十四号就来了......搬完宿舍之后就戳进实验室了，刚来的几天在耍ACMsteps，刚好回顾一下以前的知识，一回顾才发现以前理解是有多么的浅，比如背包问题，为什么循环那么循环？为什么那样就会求出最大值？没有平时那么多事的干扰，静下心来能思考不少事情，比如01背包为什么就逆向记忆，完全 阅读全文
posted @ 2016-08-07 16:53 勿忘初心0924 阅读(284) 评论(0) 推荐(0) 编辑
Best Coder #86 1002 NanoApe Loves Sequence
摘要：NanoApe Loves Sequence Accepts: 531 Submissions: 2481 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others) Time Limit: 2 阅读全文
posted @ 2016-08-06 21:33 勿忘初心0924 阅读(238) 评论(0) 推荐(0) 编辑
Best Coder #86 1001 Price List（大水题）
摘要：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 阅读全文
posted @ 2016-08-06 21:31 勿忘初心0924 阅读(172) 评论(0) 推荐(0) 编辑
补写：Best Coder #85 1001 Sum(前缀和)
摘要：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 阅读全文
posted @ 2016-08-06 20:50 勿忘初心0924 阅读(236) 评论(0) 推荐(0) 编辑
hdu 3001 Travelling(状态压缩 三进制)
摘要：Travelling Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6600 Accepted Submission(s): 2144 Prob 阅读全文
posted @ 2016-08-06 15:28 勿忘初心0924 阅读(255) 评论(0) 推荐(0) 编辑
POJ2411 Mondriaan's Dream（状态压缩）
摘要：Mondriaan's Dream Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 15295 Accepted: 8820 Description Squares and rectangles fascinated the fa 阅读全文
posted @ 2016-08-05 19:51 勿忘初心0924 阅读(181) 评论(0) 推荐(0) 编辑
hdu 3091 Necklace(状态压缩类似于TSP问题)
摘要：Necklace Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 709 Accepted Submission(s): 245 Proble 阅读全文
posted @ 2016-08-05 19:39 勿忘初心0924 阅读(317) 评论(0) 推荐(0) 编辑
HDU 1074 Doing Homework （状态压缩DP）
摘要：Doing Homework Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3595 Accepted Submission(s): 1424 阅读全文
posted @ 2016-08-05 14:09 勿忘初心0924 阅读(130) 评论(0) 推荐(0) 编辑
poj 3311 Hie with the Pie (floyd+状压dp)
摘要：Description The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can affo 阅读全文
posted @ 2016-08-05 10:46 勿忘初心0924 阅读(190) 评论(0) 推荐(0) 编辑
HDU 5791 Two（训练题002 F）
摘要：Description Alice gets two sequences A and B. A easy problem comes. How many pair of sequence A' and sequence B' are same. For example, {1,2} and {1,2 阅读全文
posted @ 2016-08-04 23:19 勿忘初心0924 阅读(232) 评论(0) 推荐(0) 编辑
HDU 5783 Divide the Sequence （训练题002 B）
摘要：Description Alice has a sequence A, She wants to split A into as much as possible continuous subsequences, satisfying that for each subsequence, every 阅读全文
posted @ 2016-08-04 23:08 勿忘初心0924 阅读(129) 评论(0) 推荐(0) 编辑
关于01背包和完全背包二重循环的顺序（前人之技，后人惊叹）
摘要：01背包： for(int I=1;i for(int j=v;j>=cost[i];j--) dp[j]=max(d[j],dp[I-cost[i]]+weight[I]); 为什么要从后往前循环！！！！ 因为吧，从后往前循环，每次取得状态不会和你之前取得状态重合，这样就符合01背包的要求，每种物 阅读全文
posted @ 2016-08-02 10:40 勿忘初心0924 阅读(890) 评论(0) 推荐(0) 编辑