poj 3615 Cow Hurdles
2012-03-25 18:51
429 查看
赤裸裸的floyd,思路很直接。很容易想到。
/*
POJ: 3615 Cow Hurdles
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#define MaxN 305
#define MaxD (1 << 20)
using namespace std;
long map[MaxN][MaxN];
int n, m, t;
void solve()
{
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
for(int k = 1; k <= n; k++)
map[j][k] = min(map[j][k], max(map[j][i], map[i][k]));
}
int main()
{
//freopen("data.in", "rb", stdin);
while(scanf("%d%d%d", &n, &m, &t) != EOF) {
for(int i = 0; i <= n; i++) {
for(int j = 0; j <= n; j++) {
map[i][j] = MaxD;
}
}
for(int i = 0; i < m; i++) {
int a, b;
long c;
scanf("%d%d%ld", &a, &b, &c);
map[a][b] = c;
}
solve();
for(int i = 0; i < t; i++) {
int a, b;
scanf("%d%d", &a, &b);
if(map[a][b] < MaxD)
printf("%d\n", map[a][b]);
else
printf("-1\n");
}
}
return 0;
}
/*
POJ: 3615 Cow Hurdles
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#define MaxN 305
#define MaxD (1 << 20)
using namespace std;
long map[MaxN][MaxN];
int n, m, t;
void solve()
{
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
for(int k = 1; k <= n; k++)
map[j][k] = min(map[j][k], max(map[j][i], map[i][k]));
}
int main()
{
//freopen("data.in", "rb", stdin);
while(scanf("%d%d%d", &n, &m, &t) != EOF) {
for(int i = 0; i <= n; i++) {
for(int j = 0; j <= n; j++) {
map[i][j] = MaxD;
}
}
for(int i = 0; i < m; i++) {
int a, b;
long c;
scanf("%d%d%ld", &a, &b, &c);
map[a][b] = c;
}
solve();
for(int i = 0; i < t; i++) {
int a, b;
scanf("%d%d", &a, &b);
if(map[a][b] < MaxD)
printf("%d\n", map[a][b]);
else
printf("-1\n");
}
}
return 0;
}
相关文章推荐
- poj 3615 :Cow Hurdles (floyd)----很好
- poj 3615 Cow Hurdles(floyd)
- POJ 3615 Cow Hurdles
- POJ 3615 Cow Hurdles(Floyd算法)
- POJ 3615 Cow Hurdles (Floyd算法)
- POJ 3615 Cow Hurdles
- POJ 3615 A - Cow Hurdles 弗洛伊德算法
- poj 3615 Cow Hurdles
- poj 3615 Cow Hurdles
- poj 3615 Cow Hurdles
- POJ 3615 Cow Hurdles
- [floyd]POJ 3615 Cow Hurdles
- POJ - 3615 Cow Hurdles (Floyd变形)
- poj 3615(Cow Hurdles) floy 算法
- POJ 3615 Cow Hurdles
- POJ 3615 Cow Hurdles(Floyd)
- Poj 3615 Cow Hurdles【Floyd】
- 【POJ 3615】Cow Hurdles
- POJ--3615|Cow Hurdles
- poj 3615 Cow Hurdles