Out of Hay
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 8973 | Accepted: 3409 |
Description
The cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) farms (numbered 1..N); Bessie starts at Farm 1. She'll traverse some or all of the M (1 <= M <= 10,000) two-way roads whose length does not exceed 1,000,000,000 that connect the farms. Some farms may be multiply connected with different length roads. All farms are connected one way or another to Farm 1.
Bessie is trying to decide how large a waterskin she will need. She knows that she needs one ounce of water for each unit of length of a road. Since she can get more water at each farm, she's only concerned about the length of the longest road. Of course, she plans her route between farms such that she minimizes the amount of water she must carry.
Help Bessie know the largest amount of water she will ever have to carry: what is the length of longest road she'll have to travel between any two farms, presuming she chooses routes that minimize that number? This means, of course, that she might backtrack over a road in order to minimize the length of the longest road she'll have to traverse.
Bessie is trying to decide how large a waterskin she will need. She knows that she needs one ounce of water for each unit of length of a road. Since she can get more water at each farm, she's only concerned about the length of the longest road. Of course, she plans her route between farms such that she minimizes the amount of water she must carry.
Help Bessie know the largest amount of water she will ever have to carry: what is the length of longest road she'll have to travel between any two farms, presuming she chooses routes that minimize that number? This means, of course, that she might backtrack over a road in order to minimize the length of the longest road she'll have to traverse.
Input
* Line 1: Two space-separated integers, N and M.
* Lines 2..1+M: Line i+1 contains three space-separated integers, A_i, B_i, and L_i, describing a road from A_i to B_i of length L_i.
* Lines 2..1+M: Line i+1 contains three space-separated integers, A_i, B_i, and L_i, describing a road from A_i to B_i of length L_i.
Output
* Line 1: A single integer that is the length of the longest road required to be traversed.
Sample Input
3 3 1 2 23 2 3 1000 1 3 43
Sample Output
43
//题目也不难,就是输出的格式上超时,郁闷啊`!!!!
最小生成树的最大边权
代码:
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
#define INF 99999999999
#define sf scanf
#define pr printf
int map[2005][2005];
int dis[2005];
int vis[2005];
int n,m;
void prime(){
int k;
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)
dis[i]=map[1][i];
dis[1]=0;vis[1]=1;
int max=-1;
for(int i=1;i<n;i++){
int min=INF;
for(int j=1;j<=n;j++){
if(!vis[j]&&dis[j]<min){
min=dis[j];
k=j;
}
}
vis[k]=1;
max=max>min?max:min;
for(int j=1;j<=n;j++){
if(!vis[j]&&map[k][j]<dis[j])
dis[j]=map[k][j];
}
}
printf("%d\n",max);
}
void init(){
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
if(i==j) map[i][j]=0;
else map[i][j]=INF;
}
}
int main(){
int a,b,c;
while(scanf("%d%d",&n,&m)!=EOF){
init();
for(int i=0;i<m;i++){
scanf("%d%d%d",&a,&b,&c);
map[a][b]=map[b][a]=min(map[a][b],c);
}
prime();
}
return 0;
}