摘要: 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 阅读(249) 评论(0) 推荐(0)
摘要: 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 阅读(229) 评论(0) 推荐(0)
摘要: 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 阅读(215) 评论(0) 推荐(0)
摘要: 借鉴:http://www.cnblogs.com/xz816111/p/4809913.html 阅读全文
posted @ 2016-08-09 17:03 勿忘初心0924 阅读(512) 评论(0) 推荐(0)
摘要: 看了一个多星期状压DP,总算有点明白,大概可以分为两种:数据是在矩阵中的,数据是线性的,在矩阵中的一般就是排兵布阵这一种的,还有一种线性结构中给定条件让你求最大权值,比如求最大权值路线,TSP问题等,前一种的状态比较好想,一般就是有了第一行的状态然后推下一行的状态,i行的状态一般由i-1行的状态推出 阅读全文
posted @ 2016-08-09 15:47 勿忘初心0924 阅读(150) 评论(0) 推荐(0)