POJ-2631 Roads in the North（最大路径）

Roads in the North Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2538   Accepted: 1248 Description 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 Source The UofA Local 1999.10.16 这道题我也是醉了，在ＤＥＶ　Ｃ＋＋上运行后没结果，在ｏｊ上提交竟然对了。。。。。 ＡＣ代码： #include<stdio.h> #include<string.h> #include<queue> #include<algorithm> using namespace std; #define G 610000 struct Edge { int from,to,val,next; } edge[G*2]; //边的结构体； int edgenum; //边的数目； int head[G]; //标记点； int dist[G]; //统计目前的最长路径； bool vis[G]; //标记参观过的点； int node ,ans; int n,m; void init() { edgenum=0; memset(head,-1,sizeof(head)); } void add(int a,int b,int c) { edge[edgenum].from=a; edge[edgenum].to=b; edge[edgenum].val=c; edge[edgenum].next=head[a]; head[a]=edgenum++; } void BFS(int x) { memset(dist,0,sizeof(dist)); memset(vis,false,sizeof(vis)); queue<int> Q; Q.push(x); vis[x]=true; dist[x]=0; ans=0; while(!Q.empty()) { int u=Q.front(); Q.pop(); for(int i=head[u];i!=-1;i=edge[i].next) { int v=edge[i].to; if(!vis[v]) { if(dist[v]<dist[u]+edge[i].val) { dist[v]=dist[u]+edge[i].val ; if(ans<dist[v]) { ans=dist[v]; node=v; } } vis[v]=true; Q.push(v); } } } } int main() { int u,v,w;init(); while(scanf("%d%d%d",&u,&v,&w)!=EOF) { add(u,v,w); add(v,u,w); } BFS(1); BFS(node); printf("%d\n",ans); return 0; }