B - Roads in the North POJ-2631
来源:互联网 发布:java语言编辑器 编辑:程序博客网 时间:2024/05/16 03:24
B - Roads in the North
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
Submit
Status
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
#include<cstdio>#include<cstring>#include<queue>using namespace std;const int MAXN=1e4+10;int head[MAXN],dis[MAXN];bool vis[MAXN];int edgenum,ans,Tnode,n;struct Edge{ int from; int to; int val; int next;}edge[MAXN];void init(){ memset(head,-1,sizeof(head));edgenum=0;}void addedge(int u,int v,int w){ edge[edgenum].from=u; edge[edgenum].to=v; edge[edgenum].val=w; edge[edgenum].next=head[u]; head[u]=edgenum++;}void bfs(int s){ memset(dis,0,sizeof(dis));memset(vis,false,sizeof(vis)); ans=0; queue<int> que; que.push(s); vis[s]=true; dis[s]=0,Tnode=s; while(!que.empty()) { int now=que.front(); que.pop(); for(int i=head[now];i!=-1;i=edge[i].next) { int go=edge[i].to; if(!vis[go]) { if(dis[go]<dis[now]+edge[i].val) dis[go]=dis[now]+edge[i].val; vis[go]=true; que.push(go); if(ans<dis[go])//灵活运用 此题中无节点数目 { ans=dis[go]; Tnode=go; } } } }}int main(){ int u,v,w; init();//忘了你 连结果都不给一个 输入也输不进去 // n=0; while(~scanf("%d%d%d",&u,&v,&w)) { // if(!u) break; 没有结束条件啊 addedge(u,v,w); addedge(v,u,w); // ++n; } bfs(1);//节点从0,1开始模板不用变 bfs(Tnode); printf("%d\n",ans); return 0;}
- B - Roads in the North POJ-2631
- POJ - 2631 Roads in the North
- poj 2631 Roads in the North
- POJ 2631 Roads in the North
- POJ 2631Roads in the North【裸题】
- 【POJ 2631 Roads in the North】
- 【POJ】[2631]Roads in the North
- POJ 2631 Roads in the North 笔记
- Roads in the North POJ
- POJ 2631 Roads in the North POJ 1985 Cow Marathon
- POJ 2631 Roads in the North(树形dp)
- POJ 2631 Roads in the North 树的直径
- 【树的直径】 POJ 2631 Roads in the North
- POJ 2631 Roads in the North(树的直径)
- poj 2631 Roads in the North(裸树的直径)
- POJ 2631 -- Roads in the North【树的直径 && 裸题】
- POJ 2631 Roads in the North(树的直径)
- 【POJ】2631 - Roads in the North(树的直径)
- hbase 双网卡 多网卡
- python 输出日志跑不动 死锁现象
- NoSQL数据库入门
- hdu 2063 过山车 二分图匹配 匈牙利算法 解题报告
- R语言中的cor和cov
- B - Roads in the North POJ-2631
- 2011年ESRI北京站IDL视频教程(全)
- eclipse 查看java进程内存情况
- hdu 1081 To The Max(暴力枚举+最大连续子数组和)
- poj 1936 All in All
- C++中this指针详解
- linux有用命令
- C语言学习4
- mapreduce java.lang.ClassNotFoundException: