- 参照别人AC的程序，怎么自己写的就老实WA？太郁闷了，太蛋疼了！ (1387) caiyueqiao 2011-11-21 12:18:22 Problem 3259
 这题WA了我16次，问题居然是我把N,M,W跟F一起读了，导致所有N,M,W都一样，郁闷死了，附邻接矩阵+邻接表Bellman_ford (28) Belldandy 2011-10-26 17:16:23 Problem 3259
- 如果你也像我一样，把YES写成Yes。。。。。 (0) bobo0906 2011-07-14 21:43:33 Problem 3259
- 貌似不能用邻接矩阵搞，附代码 (1381) speedcell4 2011-08-20 00:05:04 Problem 3259
- 一点看法 (499) quietin 2009-12-27 15:20:09 Problem 3259
- 贴个bell-man-ford和spfa 大家交流下哈... (4016) kymowind 2011-07-25 00:14:14 Problem 3259
- 水过31题，纪念一下 (0) sxd31415926 2011-07-10 10:00:32 Problem 3259
- 囧~ (44) sssxxxfff 2011-06-30 22:44:47 Problem 3259
- bellman判负权回路 (0) 962861784 2011-06-20 11:14:20 Problem 3259
- 注意把边数开到5200就能过了。还有一点，普通路径是双向的！！！ (2) pengnix 2011-04-24 17:13:39 Problem 3259
- 排名进前9000了！！优化的Bellman-Ford水过，贴下代码供参考 (1191) mmx21 2011-01-09 10:17:50 Problem 3259
- 应该先学bellman-ford再学SPFA = =。。。哎~~~ (55) zxy_snow 2011-01-02 12:44:55 Problem 3259
- 终于AC了!!!附代码!如果大家能给意见,在下感激不尽! (1050) xiangrui 2010-03-20 01:13:57 Problem 3259
- 94ms循环队列水过~推荐给你们一个博客www.comzyh.tk (0) gczsjdy1994 2010-11-16 14:41:22 Problem 3259
- 大牛来帮忙看看，bellman-ford为什么会wa (917) mountain_fly 2010-11-14 15:31:00 Problem 3259
- 关键是边的大小要正确啊！！！110ms，还可以！！！ (0) wuaicr 2010-11-15 22:54:30 Problem 3259
- 诡异的题目 (3536) It_is_rainning_now 2010-10-20 13:08:27 Problem 3259
- 这组数据错了,还是A了 (43) 407811696 2010-08-20 18:39:04 Problem 3259
- 求大牛看看为何超时 (1026) 13091118 2010-08-13 15:48:52 Problem 3259
- 菜鸟：：请问错在哪儿？？ (826) swust20095862 2010-08-07 16:14:56 Problem 3259
- 这题真纠结 (61) whosyourdaddy 2010-07-15 04:55:00 Problem 3259
- poj真是奇怪，一道题，交两次，一次TLE，一次16ms (1003) stupidjohn 2010-07-01 17:47:29 Problem 3259
- 为什么测得官方数据都对了，但一交就Wrong Answer (52) lvcheng 2010-04-09 10:25:47 Problem 3259
- 哈哈， 水过，水过，用SPFA或BELLMAN-ford就可以了 (0) imxian 2010-06-29 16:20:43 Problem 3259
- 读了好久还是不懂啊啊啊啊啊啊啊啊啊啊 (0) allen4053040allen 2010-05-06 19:06:27 Problem 3259
- bellmanFord或者SPFA都可以 (55) xiewill 2010-04-07 20:03:22 Problem 3259
- spfa~第一次进rank20 (0) crbtmac 2009-12-15 14:18:54 Problem 3259
- 用bellman-ford,因为"a bidirectional path between S and E that requires T seconds to traverse. Two fields might be connected by more than one path."WA两次,以1969ms险过,后来者引以为戒~ (2) Rieman 2009-12-01 18:16:23 Problem 3259
- 这题有点纠结~~~~ (18) Be_the_top 2009-11-03 13:57:28 Problem 3259
- 没有洞的边是双向的,RE了N次... (0) 19881005 2009-09-10 22:19:53 Problem 3259
- 哎，写了N次，AC了开心啊，用SPFA数组模拟队列写了个500ms，慢了啊 (0) kyxyljb 2009-08-16 10:25:18 Problem 3259
- 汗………………………… (29) leon_L 2009-08-14 09:08:42 Problem 3259
|
