在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗?
输入保证至少存在1条商店到赛场的路线。
2 1 1 2 3 3 3 1 2 5 2 3 5 3 1 2 0 0
3 2
最短路的问题,稀疏图,没有负权边,所以Floyd跟Dijkstra都行;
AC代码:
Floyd:
#include<cstdio>
#include<cstring>
const int inf = 0x3f3f3f3f;
const int N = 1010;
int n, m;
int e[N][N];
void Floyd(int st, int ed){
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(e[i][j]>e[i][k] + e[k][j]){
e[i][j] = e[i][k] + e[k][j];
}
}
}
}
printf("%d\n", e[st][ed]);
}
int main(){
while(scanf("%d%d", &n, &m)!=EOF && (n!=0||m!=0)){
memset(e, inf, sizeof(e));
while(m--){
int a ,b, c;
scanf("%d%d%d", &a, &b, &c);
e[a][b] = e[b][a] = c;
}
Floyd(1, n);
}
return 0;
}
Dijkstra:
#include<cstdio>
#include<cstring>
int n, m;
const int inf = 0x3f3f3f3f;
const int N = 1010;
int e[N][N], dis[N], book[N];
void Dijkstra(int st, int ed){
memset(book, 0, sizeof(book));
book[st] = 1;
for(int i = 1; i <= n; i++){
dis[i] = e[st][i];
}
int u;
for(int i = 1; i <= n-1; i++){
int minn = inf;
for(int j = 1; j <= n; j++){
if(book[j] == 0 && minn > dis[j]){
minn = dis[j];
u = j;
}
}
book[u] = 1;
for(int j = 1; j <= n; j++){
if(dis[j] > e[u][j] + dis[u]){
dis[j] = e[u][j] +dis[u];
}
}
}
printf("%d\n", dis[ed]);
}
int main(){
while(scanf("%d%d",&n, &m)!=EOF&&(n!=0||m!=0)){
memset(e, inf, sizeof(e));
while(m--){
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
e[a][b] = e[b][a] = c;
}
Dijkstra(1,n);
}
return 0;
}