链式前向星传送门:https://blog.csdn.net/lookqaq/article/category/7893137
题目链接:http://poj.org/problem?id=2631
Time limit
1000 ms
Memory limit
65536 kB
Building and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that there is only one route from a village to a village that does not pass through some other village twice.
Given is an area in the far North comprising a number of villages and roads among them such that any village can be reached by road from any other village. Your job is to find the road distance between the two most remote villages in the area.
The area has up to 10,000 villages connected by road segments. The villages are numbered from 1.
Input
Input to the problem is a sequence of lines, each containing three positive integers: the number of a village, the number of a different village, and the length of the road segment connecting the villages in kilometers. All road segments are two-way.
Output
You are to output a single integer: the road distance between the two most remote villages in the area.
Sample Input
5 1 6 1 4 5 6 3 9 2 6 8 6 1 7
Sample Output
22
题意:求相距最远的两个村庄的距离。zz好水,翻车好多次。。
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<string.h>
using namespace std;
#define MAXN 100501
struct NODE{
int w;
int e;
int next; //next[i]表示与第i条边同起点的上一条边的储存位置
}edge[MAXN];
int cnt,biao,ans,vis[MAXN];
int u,v,w;
int head[MAXN],dis[MAXN];
void add(int u,int v,int w){
edge[cnt].w=w;
edge[cnt].e=v; //edge[i]表示第i条边的终点
edge[cnt].next=head[u]; //head[i]表示以i为起点的最后一条边的储存位置
head[u]=cnt++;
}
void BFS(int x)
{
queue<int>que;
memset(vis,0,sizeof(vis));
memset(dis,0,sizeof(dis));
dis[x]=0;
vis[x]=1;
que.push(x);
ans=0;
while(!que.empty())
{
int q=que.front();
que.pop();
for(int i=head[q];i!=-1;i=edge[i].next)
{
if(!vis[edge[i].e]&&dis[edge[i].e]<dis[q]+edge[i].w)
{
dis[edge[i].e]=dis[q]+edge[i].w;
if(ans<dis[edge[i].e])
{
ans=dis[edge[i].e];
biao=edge[i].e;
}
vis[edge[i].e]=1;
que.push(edge[i].e);
}
}
}
return ;
}
int main()
{
memset(head,-1,sizeof(head));
cnt=0;
while(scanf("%d%d%d",&u,&v,&w)!=EOF){
add(u,v,w);
add(v,u,w);
}
BFS(1);
BFS(biao);
printf("%d\n",ans);
return 0;
}