codevs 1519 过路费

【分析】
同NOIP 2013 货车运输

---

【代码】

//codevs 1519 过路费 
#include<iostream>
#include<vector>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define mp make_pair
#define fo(i,j,k) for(i=j;i<=k;i++)
using namespace std;
const int mxn=10005;
vector < pair<int,int> > e[mxn];
int n,m,cnt,ans,q;
int dep[mxn],father[mxn],bz[mxn][16],w[mxn][16];  //2^14
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
struct edge {int l,r,dis;}f[100005];
inline bool comp(const edge &u,const edge &v) {return u.dis<v.dis;}
inline int find(int x)
{
    if(x!=father[x]) father[x]=find(father[x]);
    return father[x];
}
inline void dfs(int u,int fa)
{
    for(int i=0;i<e[u].size();i++)
    {
        int v=e[u][i].first,d=e[u][i].second;
        if(v!=fa)
        {
            dep[v]=dep[u]+1;
            bz[v][0]=u,w[v][0]=d;
            dfs(v,u);
        }
    }
}
inline int lca(int x,int y)  //x is deep
{
    int i,j,ans=0;
    for(i=15;i>=0;i--)
      if(dep[bz[x][i]]>=dep[y]) 
        ans=max(ans,w[x][i]),x=bz[x][i];
    if(x==y) return ans;
    for(i=15;i>=0;i--)
      if(bz[x][i]!=bz[y][i])
        ans=max(ans,max(w[x][i],w[y][i])),x=bz[x][i],y=bz[y][i];
    ans=max(ans,max(w[x][0],w[y][0]));
    return ans;
}
int main()
{
    int i,j,x,y,z;
    n=read(),m=read();
    fo(i,1,m)
      f[i].l=read(),f[i].r=read(),f[i].dis=read();
    sort(f+1,f+m+1,comp);
    fo(i,1,n) father[i]=i;
    fo(i,1,m)
    {
        int r1=find(f[i].l),r2=find(f[i].r);
        if(r1!=r2)
        {
            e[f[i].l].push_back(mp(f[i].r,f[i].dis));
            e[f[i].r].push_back(mp(f[i].l,f[i].dis));
            father[r1]=r2;
        }
    }
    fo(i,1,n) if(!dep[i]) dfs(i,0);
    fo(j,1,15)
      fo(i,1,n)
        bz[i][j]=bz[bz[i][j-1]][j-1],w[i][j]=max(w[i][j-1],w[bz[i][j-1]][j-1]);;
    q=read();
    while(q--)
    {
        x=read(),y=read();
        if(dep[x]<dep[y]) swap(x,y);
        printf("%d\n",lca(x,y));
    }
    return 0;
}