HDU 2874 森林的LCA

这道题的题意就是离线求LCA

求一个森林中，每两个点的最近距离，如果不在一棵树上，则输出不行。

那么我们就设立一个超级远点，这个点和每个树的根连接，如果求lca的时候，是这个点，就代表不在一棵树上

//#pragma comment(linker, "/STACK:1024000000,1024000000")

#include <iostream>
#include <vector>
#include <cstdio>
#include <cstring>
#define maxn 11111
using namespace std;
struct node{
    int v,next,len;
}edge[440003];

int father[maxn],vis[maxn],lca[1000002];
short asku[2000002],askv[2000002];
int asknext[2000002];
int askid[2000002];
int head[11111],h[11111],dis[11111];
int n,m,c,e,q;
int pre[maxn];
void addedge(int u,int v,int w){
    edge[e].v = v;
    edge[e].len = w;
    edge[e].next = head[u];
    head[u] = e++;
}

void addquery(int u,int v,int w){
    askv[q] = v;
    asku[q] = u;
    askid[q] = w;
    asknext[q] = h[u];
    h[u] = q++;
}
void init(){
    for(int i = 0 ; i <= n + 1 ; i ++){
        father[i] = i;
        pre[i] = i;
        vis[i] = 0;
        dis[i] = 0;
    }
    memset(head,-1,sizeof(head));
    memset(h,-1,sizeof(h));
    e = 0;
    q = 0;
}

int find(int x){
    if(father[x] == x)
        return x;
    int t = find(father[x]);
    father[x] = t;
    return t;
}

int fg(int x){
    if(pre[x] == x)
        return x;
    int t = find(pre[x]);
    pre[x] = t;
    return t;
}


void un(int a,int b){
    int x = fg(a);
    int y = fg(b);
    pre[x] = y;
}
void LCA(int u){
    father[u] = u;
    vis[u] = 1;
    for(int i = h[u] ; i != -1 ; i = asknext[i]){
        int v = askv[i];
        if(vis[v] == 1){
            int root = find(v);
            lca[askid[i]] = root;
        }
    }
    for(int i = head[u] ; i != -1 ; i = edge[i].next){
        int v = edge[i].v;
        if(!vis[v]){
            dis[v] = dis[u] + edge[i].len;
            LCA(v);
            father[v] = u;
        }
    }
}
int main()
{
    int T,c;
    while(scanf("%d%d%d",&n,&m,&c) != EOF){
        init();
        for(int i = 0 ; i < m ; i++){
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            addedge(u,v,w);
            un(u,v);
            addedge(v,u,w);
        }
        for(int i = 0 ; i < c ; i ++){
            int a,b;
            scanf("%d%d",&a,&b);
            addquery(a,b,i);
            addquery(b,a,i);
        }
        for(int i = 1 ; i <= n ; i ++){
            if(pre[i] == i){
                addedge(i,n+1,999999999);
                addedge(n+1,i,999999999);
                un(i,n+1);
                un(n+1,i);
            }
        }
        LCA(n+1);
        for(int i = 0 ; i < q ; i += 2){
            if(lca[askid[i]] != n + 1)
                printf("%d\n",dis[asku[i]]+dis[askv[i]]-2*dis[lca[askid[i]]]);
            else
                printf("Not connected\n");
        }
    }
    return 0;
}