Codeforces1253D 带权并查集

https://codeforces.com/contest/1253/problem/D
n个点 m条边 <=2e5
l<m<r l能到r 则l一定得满足可以到中间点
加最小边数能满足条件
14 8
1 2
2 7
3 4
6 3
5 7
3 8
6 8
11 12

1

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+5;
const ll mod=1e9+7;
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define pb push_back
ll T,n,m,ans,u,v;
ll a[maxn],pre[maxn],f[maxn];
void init(ll n){
	for(int i=1;i<=n;i++){
		f[i]=i;	//最大值是它本身 
		pre[i]=i;
	}
}
ll find(ll x){
	if(pre[x]!=x)
		pre[x]=find(pre[x]);
	return pre[x];
}
void join(ll x,ll y){
	ll fx=find(x),fy=find(y);
	if(fx!=fy)
		pre[fy]=fx;
	f[fx]=max(f[fx],f[fy]);
}
int main(){
   cin>>n>>m;
   init(n);
   while(m--){
   		cin>>u>>v;
   		join(u,v);
   }
   ll x=1;
   for(int i=2;i<=n;i++){
   		if(f[find(pre[x])]<i)	x=i;
   		if(find(x)!=find(i)){	//7,8相同的根 7,9相同的根 
   			ans++;
   			join(x,i);
		}
   }
   cout<<ans<<endl;
	return 0;
}