- 博客(8)
- 收藏
- 关注
RSS订阅原创 poj1273
Drainage Ditches 点击打开链接 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 56466 Accepted: 21694 Description Every time it rains on Farmer John's fields, a p
2014-08-27 10:51:41
1002
原创 poj1511 Invitation Cards
题目:http://poj.org/problem?id=1511 题意：就是求所有的节点到节点 1，然后从节点1返回的最小距离的和。 简单SPFA，和poj 3268 无多少差异。 #include #include #include #include #include #include #include #include #include #include #include #inclu
2014-08-20 16:15:38
781
原创 zoj1456 Minimum Transport Cost
ZOJ Problem Set - 1456 Minimum Transport Cost Time Limit: 2 Seconds Memory Limit: 65536 KB These are N cities in Spring country. Between each pair of cities there may be one transportat
2014-08-17 15:09:25
1129
1
原创 poj3259 Wormholes
题意：N块地，M条路，W个虫洞。判断有没有可以是时间倒流的路径。注意把W次输入的w[i]改成-w[i]。 SPFA:判断有没有入队次数超过N的点。
2014-08-14 09:44:43
1249
原创 poj1679 The Unique MST
The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20421 Accepted: 7183 Description Given a connected undirected graph, tell if its minimum spann
2014-08-11 13:58:37
864
原创 poj 1979 Red and Black
Red and Black Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 22300 Accepted: 12041 Description There is a rectangular room, covered with square tiles. Each
2014-08-04 21:10:55
840
原创 zoj 1649 Rescue
Rescue Time Limit: 2 Seconds Memory Limit: 65536 KB Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to s
2014-08-04 10:42:35
805
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人