hdu1874 畅通工程续
2016-01-19 17:44
316 查看
#include <stdio.h>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int INF = 999999;
const int N = 1002;
int path
;
int m, n;
int Min(int a, int b)
{
return a > b ? b : a;
}
void floyd()
{
int i, j, k;
for(k = 0; k < n; k++)
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
path[i][j] = Min(path[i][j], path[i][k] + path[k][j]);
}
int main()
{
int i, j, A, B, C, st, ed;
while(~scanf("%d%d", &n, &m))
{
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
{
if(i == j) path[i][j] = 0;
else path[i][j] = path[j][i]= INF;
}
for(i = 0; i < m; i++)
{
scanf("%d%d%d", &A, &B, &C);
if(path[A][B] > C) path[A][B] = path[B][A] = C;
}
floyd();
scanf("%d%d", &st, &ed);
if(path[st][ed] == INF) path[st][ed] = -1;
printf("%d\n", path[st][ed]);
}
return 0;
}
心得:权值赋值前记得加条件。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int INF = 999999;
const int N = 1002;
int path
;
int m, n;
int Min(int a, int b)
{
return a > b ? b : a;
}
void floyd()
{
int i, j, k;
for(k = 0; k < n; k++)
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
path[i][j] = Min(path[i][j], path[i][k] + path[k][j]);
}
int main()
{
int i, j, A, B, C, st, ed;
while(~scanf("%d%d", &n, &m))
{
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
{
if(i == j) path[i][j] = 0;
else path[i][j] = path[j][i]= INF;
}
for(i = 0; i < m; i++)
{
scanf("%d%d%d", &A, &B, &C);
if(path[A][B] > C) path[A][B] = path[B][A] = C;
}
floyd();
scanf("%d%d", &st, &ed);
if(path[st][ed] == INF) path[st][ed] = -1;
printf("%d\n", path[st][ed]);
}
return 0;
}
心得:权值赋值前记得加条件。
相关文章推荐
- HDU 1568
- HDU1290
- HDU1568(Fobonacci公式)
- HDU ACM Step 2.2.2 Joseph(约瑟夫环问题)
- HDU 1405
- HDU 1297
- hdu 1205
- hdu 2087
- hdu 1016
- HDU 4898 The Revenge of the Princess’ Knight ( 2014 Multi-University Training Contest 4 )
- HDU 5592 ZYB's Premutation 线段树(查找动态区间第K大)
- HDU 5240 Exam (好水的题)
- HDU5237 Base64 大模拟
- HDU 1000
- HDU 1001
- 2015-11-11 hdu新生赛 A题(AC)
- 2015-11-11 hdu新生赛 C题(结束后一发AC)
- 2015-11-11 hdu新生赛 E题(结束后一发AC)
- 2015-11-11 hdu新生赛 F题(结束后一发AC)
- hdu-5385