最短路径
xiaofengsheng
这个作者很懒,什么都没留下…
展开
-
pku 1062 昂贵的婚礼
#include #include using namespace std;#define MAX 101 #define INF 999999999 int matrix[MAX][MAX];int VertexValue[MAX];int VertexRank[MAX];int s[MAX];int main(){ int i,j;原创 2009-01-14 11:35:00 · 737 阅读 · 0 评论 -
pku 1125 strokers
#include using namespace std;#define MAX 101#define INF 100000int matrix[MAX][MAX];int main(){ int i,j,k; int N,n; int adj; while(scanf("%d",&N) && N) { //input for(i=1;i<=原创 2009-01-14 18:55:00 · 778 阅读 · 0 评论 -
pku 1797
#include using namespace std;#define MAX 1001#define INF 1000001int matrix[MAX][MAX];int dis[MAX];int s[MAX];void MaxWeight(int& v){ int u; for(int i = 1; i <= v; ++i) { dis[i原创 2009-02-24 22:12:00 · 758 阅读 · 0 评论 -
pku 2253 Frogger
#include #include using namespace std;#define MAX 201#define INF 10000.0ffloat matrix[MAX][MAX];int s[MAX];float dis[MAX];typedef struct point{ int x; int y; int flag;}point;原创 2009-02-25 20:06:00 · 875 阅读 · 1 评论