题目描述
题解
强行不写链剖。
先求最小生成树,然后倍增求最大值。
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int max_n=2e4+5;
const int max_m=3e4+5;
const int max_e=max_n*2;
const int sz=14;
int n,m,k,x,y,ans;
int fa[max_n];
int tot,point[max_n],next[max_e],v[max_e],c[max_e];
int h[max_n],mi[sz+1];
int f[max_n][sz+1],s[max_n][sz+1];
struct hp{
int u,t,w;
}edge[max_m];
inline int cmp(hp a,hp b){
return a.w<b.w;
}
inline int find(int x){
if (fa[x]==x) return x;
fa[x]=find(fa[x]);
return fa[x];
}
inline void merge(int x,int y){
int f1=find(x); int f2=find(y);
fa[f1]=f2;
}
inline void addedge(int x,int y,int z){
++tot; next[tot]=point[x]; point[x]=tot; v[tot]=y; c[tot]=z;
++tot; next[tot]=point[y]; point[y]=tot; v[tot]=x; c[tot]=z;
}
inline void build(int x,int fa,int dep){
h[x]=dep;
for (int i=1;i<sz;++i){
if (h[x]-mi[i]<1) break;
f[x][i]=f[f[x][i-1]][i-1];
s[x][i]=max(s[x][i-1],s[f[x][i-1]][i-1]);
}
for (int i=point[x];i;i=next[i])
if (v[i]!=fa){
f[v[i]][0]=x;
s[v[i]][0]=c[i];
build(v[i],x,dep+1);
}
}
inline int lca(int x,int y){
int ans=0;
if (h[x]<h[y]) swap(x,y);
int k=h[x]-h[y];
for (int i=sz-1;i>=0;--i)
if ((k>>i)&1)
ans=max(ans,s[x][i]),x=f[x][i];
if (x==y) return ans;
for (int i=sz-1;i>=0;--i)
if (f[x][i]!=f[y][i]){
ans=max(ans,max(s[x][i],s[y][i]));
x=f[x][i],y=f[y][i];
}
ans=max(ans,max(s[x][0],s[y][0]));
return ans;
}
int main(){
scanf("%d%d%d",&n,&m,&k);
mi[0]=1;
for (int i=1;i<sz;++i) mi[i]=mi[i-1]*2;
for (int i=1;i<=m;++i)
scanf("%d%d%d",&edge[i].u,&edge[i].t,&edge[i].w);
sort(edge+1,edge+m+1,cmp);
for (int i=1;i<=n;++i) fa[i]=i;
int cnt=0;
for (int i=1;i<=m;++i){
if (find(edge[i].u)!=find(edge[i].t)){
merge(edge[i].u,edge[i].t);
addedge(edge[i].u,edge[i].t,edge[i].w);
++cnt;
if (cnt==n-1) break;
}
}
build(1,0,1);
for (int i=1;i<=k;++i){
scanf("%d%d",&x,&y);
ans=lca(x,y);
printf("%d\n",ans);
}
}