suikay的专栏

AccecptTime:  2008-12-30 10:07:12Language:     C++Memory:       4184KTime:         1641MSErrors:       3PE + 4WA + 1TL + 1ML + 2REAlgorithm:    Dijkstra#include #include #include #include #include

 AccecptTime:      2008-12-30 11:11:23Language:         C++Memory:           572KTime:             16MSErrors:           2WAAlgorithm:        Dijkstra最短路径#include#include#include #include #include usi

AccecptTime:       2009-01-01 12:05:53Language:          C++Memory:            4112KTime:              63MSErrors:            2WA + 1TLAlgorithm:         Dijkstra最短路径#include #defi

AccecptTime:  2009-01-04 17:12:21Language: C++Memory:  296KTime:  0MSErrors:  3WAAlgorithm: Dijkstra最短路径#include #include #include #include 

在做了几道查分约束的题目后终于找到一点感觉了。查分约束就是把形式类似于： A[i1] - A[j1]  A[i2] - A[j2]  ....的方程全部列写出来,把A[i]作为源点,A[j]作为末点,X作为权,把边全部放入数组中进行Bellman-Ford。至于初始化和判断条件看具体的情况。下面是一道例题poj的3159：#include #include #define N 30010#defi

Memory: 2776KTime: 860MSLanguage: G++Faults:5 wa+1 oleAlgorithm:查分约束/* 这题我是用差分约束做的 求的是最短路,如果有负环 则 inreliable*/#include #include #include using namespace std;#define NIL 100000000#d