POJ Problem 2631 Roads in the North【树的直径】
2016-08-02 15:13
477 查看
Roads in the North
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 <cstdio>
#include <queue>
#define MAXN 30010
using namespace std;
struct node{
int from, to, val, next;
} edge[MAXN];
bool vis[MAXN];
int dist[MAXN], head[MAXN], edgenum, ans, s;
void init() {
memset(head, -1, sizeof(head));
edgenum = 0;
}
void addedge(int x, int y, int z) {
edge[edgenum].from = x;
edge[edgenum].to = y;
edge[edgenum].val = z;
edge[edgenum].next = head[x];
head[x] = edgenum++;
}
void bfs(int x) {
queue<int> que; ans = 0;
memset(vis, false, sizeof(vis));
memset(dist, 0, sizeof(dist));
while (!que.empty()) que.pop();
que.push(x); vis[x] = true;
while (que.size()) {
int a = que.front(); que.pop();
for (int i = head[a]; i != -1; i = edge[i].next) {
int b = edge[i].to;
if (!vis[b] && dist[b] < dist[a] + edge[i].val) {
dist[b] = dist[a] + edge[i].val;
if(ans < dist[b]) {
ans = dist[b]; s = b;
}
vis[b] = true; que.push(b);
}
}
}
}
int main() {
int a, b, c, n, m; init();
while (scanf("%d%d%d", &a, &b, &c) != EOF) {
addedge(a, b, c); addedge(b, a, c);
}
bfs(1); bfs(s);
printf("%d\n", ans);
return 0;
}
相关文章推荐
- POJ-2631-Roads in the North-树的直径(最长路)
- poj2631 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(裸树的直径)
- 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(树的直径 裸模板)
- 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 2631 Roads in the North
- POJ 2631 -- Roads in the North【树的直径 】
- 【POJ】-2631-Roads in the North(树的直径)