11 2014 档案

杭电3339————最短路（SPFA）+ 01背包
摘要：题目链接：点击打开链接题目大致如下。每一个核电站都有一定的电力值，你需要控制这些核电站，使得你控制的电力值的大小超过所有核电站电力值的一半，在保证这个前提的基础上，寻找最短路。控制核电站，需要一些坦克，坦克的数量是无限的（！注意这个地方！）一开始的思路：做一个如下的结构体：typedef struc... 阅读全文
posted @ 2014-11-26 20:14 SixDayCoder 阅读(206) 评论(0) 推荐(0)
杭电1869————floyd的简单应用
摘要：六度分离Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4773Accepted Submission(s): 1933Problem Descri... 阅读全文
posted @ 2014-11-24 20:30 SixDayCoder 阅读(220) 评论(0) 推荐(0)
杭电1385————Dijkstra+输出路径
摘要：Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7701Accepted Submission(s): ... 阅读全文
posted @ 2014-11-23 13:39 SixDayCoder 阅读(289) 评论(0) 推荐(0)
杭电1217————不像最短路的"最短路"
摘要：ArbitrageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4790Accepted Submission(s): 2183Problem D... 阅读全文
posted @ 2014-11-12 19:38 SixDayCoder 阅读(200) 评论(0) 推荐(0)
杭电3790————最短路问题
摘要：最短路径问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14059Accepted Submission(s): 4310Problem Des... 阅读全文
posted @ 2014-11-11 16:18 SixDayCoder 阅读(173) 评论(0) 推荐(0)
杭电3371——————MST的简单变形
摘要：Connect the CitiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10598Accepted Submission(s): 300... 阅读全文
posted @ 2014-11-05 20:48 SixDayCoder 阅读(194) 评论(0) 推荐(0)
CodeForces 339D————线段树之单点修改
摘要：D. Xenia and Bit Operationstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputXenia the beginner pr... 阅读全文
posted @ 2014-11-03 16:29 SixDayCoder 阅读(386) 评论(0) 推荐(0)