AccecptTime: 2009-01-01 12:05:53
Language: C++
Memory: 4112K
Time: 63MS
Errors: 2WA + 1TL
Algorithm: Dijkstra最短路径
- #include <stdio.h>
- #define MAX 1001
- #define INFINITY 999999999
- int road[MAX][MAX];
- int A[MAX];
- int B[MAX];
- int n;
- void Dijkstra(int x)
- {
- int final[MAX];
- int v;
- for(int i = 1; i <= n; i++) {
- final[i] = false;
- A[i] = road[i][x];
- }
- final[x] =