貌似又是一道模板题,kruskal重构树233,合并时按秩合并,深度最多logn,这样以后,连倍增都可以不要,直接走就好了。
#include<bits/stdc++.h>
#define N 15000
#define Max(x,y,z) max(max(x,y),z)
using namespace std;
int n,m,k,num,x,y;
int f[N+1],siz[N+1];
int father[N+1],dis[N+1];
int dep[N+1];
struct edge{
int st;
int ed;
int val;
};edge A[2*N+1];
inline char nc()
{
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
int x=0;
char c=nc();
while(c<'0'||c>'9')c=nc();
while(c<='9'&&c>='0')x=x*10+c-'0',c=nc();
return x;
}
bool cmp(const edge &A,const edge &B)
{
return A.val<B.val;
}
int find(int x)
{
return x==f[x]?f[x]:f[x]=find(f[x]);
}
int getdep(int x)
{
if(dep[x])return dep[x];
if(!father[x])return dep[x]=1;
return dep[x]=getdep(father[x])+1;
}
int qurry(int x,int y)
{
int tmp=0;
if(dep[x]<dep[y])swap(x,y);
while(dep[x]>dep[y])tmp=max(tmp,dis[x]),x=father[x];
while(x!=y)tmp=Max(tmp,dis[x],dis[y]),x=father[x],y=father[y];
return tmp;
}
int main()
{
n=read(),m=read(),k=read();
for(int i=1;i<=n;i++)f[i]=i;
for(int i=1;i<=m;i++)
A[i].st=read(),A[i].ed=read(),A[i].val=read();
sort(A+1,A+m+1,cmp);
for(int i=1;i<=m;i++)
{
int fx=find(A[i].st),fy=find(A[i].ed);
if(fx==fy)continue;
num++;
if(siz[fx]>siz[fy])swap(fx,fy);
f[fx]=fy;
siz[fy]=max(siz[fy],siz[fx]+1);
father[fx]=fy;
dis[fx]=A[i].val;
if(num==n-1)break;
}
for(int i=1;i<=n;i++)getdep(i);
for(int i=1;i<=k;i++)
{
x=read(),y=read();
printf("%d\n",qurry(x,y));
}
return 0;
}