LightOJ - 1094 Farthest Nodes in a Tree【bfs+前向星||vector存图】

点击打开题目
1094 - Farthest Nodes in a Tree
PDF (English) Statistics Forum
Time Limit: 2 second(s) Memory Limit: 32 MB
Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are weighted and undirected. That means you have to find two nodes in the tree whose distance is maximum amongst all nodes.
Input
Input starts with an integer T (≤ 10), denoting the number of test cases.
Each case starts with an integer n (2 ≤ n ≤ 30000) denoting the total number of nodes in the tree. The nodes are numbered from 0 to n-1. Each of the next n-1lines will contain three integers u v w (0 ≤ u, v < n, u ≠ v, 1 ≤ w ≤ 10000) denoting that node u and v are connected by an edge whose weight is w. You can assume that the input will form a valid tree.
Output
For each case, print the case number and the maximum distance.
Sample Input
Output for Sample Input
2
4
0 1 20
1 2 30
2 3 50
5
0 2 20
2 1 10
0 3 29
0 4 50
Case 1: 100
Case 2: 80
Notes
Dataset is huge, use faster i/o methods.
题意：
给出一个无向图，找树的直径；
思路：
树的直径的裸题，用前向星存图（多用），从任意一点出发广搜，bfs出一个最长路径的叶子节点id（这个节点就是树的直径的一个端点），再从id点出发二次深搜，这次搜出最长路径的叶子节点就是树的直径的另外一个节点，那么第二次深搜的这个路径就是树的直径，那么这样两次深搜就可以找出树的直径；

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cmath>
#include<vector> 
#define max_n 100010
using  namespace std;
typedef long long LL;
int head[max_n],dis[max_n],vis[max_n];
int t,n,ans,id=0;

struct node{
    int to;
    int val;
    int next;
}edge[max_n];

void addedge(int u,int v,int w){ //添加边，前向星存图 
    node e={v,w,head[u]};
    edge[id]=e;
    head[u]=id++;
}

void bfs(int x){
    queue<int> q;
    memset(dis,0,sizeof(dis));
    memset(vis,0,sizeof(vis));
    vis[x]=1;
    ans=0;
    id=x;
    q.push(x);
    while(!q.empty()){
        int p=q.front();
        q.pop();
        for(int i=head[p];i!=-1;i=edge[i].next){
            node now=edge[i];
            if(!vis[now.to] && dis[now.to]<dis[p]+now.val){
                vis[now.to]=1;
                dis[now.to]=dis[p]+now.val;
                if(dis[now.to]>ans){
                    ans=dis[now.to];
                    id=now.to;
                }
                q.push(now.to);
            }
        }

    }
}

int main(){
    int a,b,c;
    scanf("%d",&t);
    while(t--){
        ans=0;
        memset(head,-1,sizeof(head));
        scanf("%d",&n);
        for(int i=0;i<n-1;i++){
            scanf("%d %d %d",&a,&b,&c);
            a++,b++; 
            addedge(a,b,c); //无向图 
            addedge(b,a,c);
        }
        bfs(1); //任意一点
        bfs(id); //直径的一个端点 
        static int p=1;
        printf("Case %d: %d\n",p++,ans);
    }
    return 0;
}

bfs+vector存图写法（换种存图的方式）：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#define max_n 100010
using namespace std;
vector <int> v[max_n];
vector <int> dis[max_n];
int vis[max_n], mst[max_n];
int n;

void init() {
    for(int i = 0; i < n; i++) {
        v[i].clear();
        dis[i].clear();
    }
}

int bfs(int x) {
    queue<int> q;
    memset(vis, 0, sizeof(vis));
    memset(mst, 0, sizeof(mst));
    vis[x] = 1;
    mst[x] = 0;
    int ans = 0, maxx = 0;
    q.push(x);
    while(!q.empty()) {
        int u = q.front();
        q.pop();
        for(int i = 0; i < v[u].size(); i++) {
            if(!vis[v[u][i]]) {
                vis[v[u][i]] = 1;
                mst[v[u][i]] = mst[u] + dis[u][i];
                q.push(v[u][i]);
                if(mst[v[u][i]] > maxx) {
                    maxx = mst[v[u][i]]; 
                    ans = v[u][i];
                }
            }
        }
    }
    return ans;
}

int main() {
    int t, t1, t2, val;
    scanf("%d", &t);
    while(t--) {
        scanf("%d", &n);
        init();
        for(int i = 1; i < n; i++) {
            scanf("%d %d %d", &t1, &t2, &val);
            v[t1].push_back(t2);
            v[t2].push_back(t1);
            dis[t1].push_back(val);
            dis[t2].push_back(val);
        }
        int id = bfs(1);
        int ans = bfs(id);
        static int p = 1;
        printf("Case %d: %d\n", p++, mst[ans]);
    }
    return 0;
}