Sicily 1024. Magic Island

最新推荐文章于 2017-05-07 20:34:23 发布

Nightonke

最新推荐文章于 2017-05-07 20:34:23 发布

阅读量892

点赞数

分类专栏： sicily 文章标签： sicily

本文链接：https://blog.csdn.net/u012925008/article/details/44763237

版权

sicily 专栏收录该内容

413 篇文章 0 订阅

订阅专栏

1024. Magic Island

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

There are N cities and N-1 roads in Magic-Island. You can go from one city to any other. One road only connects two cities. One day, The king of magic-island want to visit the island from the capital. No road is visited twice. Do you know the longest distance the king can go.

Input

There are several test cases in the input
A test case starts with two numbers N and K. (1<=N<=10000, 1<=K<=N). The cities is denoted from 1 to N. K is the capital.

The next N-1 lines each contain three numbers X, Y, D, meaning that there is a road between city-X and city-Y and the distance of the road is D. D is a positive integer which is not bigger than 1000.
Input will be ended by the end of file.

Output

One number per line for each test case, the longest distance the king can go.

Sample Input

3 1
1 2 10
1 3 20

Sample Output

Problem Source

ZSUACM Team Member

这里要注意到，有n个点，但是只有n-1条路径，说明是树，用dfs求树的最长路径：

（用c++输入0.35s，用c输入0.18s）

#include <iostream>
#include <vector>
#include <string.h>
#include <cstring>
#include <stdio.h>
using namespace std;

struct Road {
    int to, distance;//目的地和距离
    Road(int new_to, int new_distance) {//这样写为了读入方便
        to = new_to;
        distance = new_distance;
    }
};

vector<Road> roads[10001];//注意这里是二维动态数组
bool vis[10001];
int longest_road, n;

void dfs(int from, int dis) {
    if (dis > longest_road)//更新最长的路径
        longest_road = dis;
    
    vis[from] = true;//这个点已经访问过，不重复访问
    
    for (int i = 0; i < (int)roads[from].size(); i++) {//遍历from所能连通的点并判断是否dfs
        if (!vis[roads[from][i].to]) {
            dfs(roads[from][i].to, dis + roads[from][i].distance);
        }
    }
}

int main() {
    int k, i, temp_from, temp_to, new_distance;
    
    while (cin >> n >> k) {
        
        longest_road = 0;
        memset(vis, false, sizeof(vis));
        memset(roads, 0, sizeof(roads));
        
        for (i = 0; i < n - 1; i++) {
            scanf("%d%d%d", &temp_from, &temp_to, &new_distance);
            roads[temp_from].push_back(Road(temp_to, new_distance));//注意这里两点是互通的
            roads[temp_to].push_back(Road(temp_from, new_distance));
        }
        
        dfs(k, 0);
        printf("%d\n", longest_road);
    }
    return 0;
}