题意:n个点,m条边。每次询问若没有 第l条至第r条边时,有几个集合
思路:处理前缀和后缀,把前(后)x条边的情况记录下来,询问是把(1,l-1)的前缀 和 (r+1,m)的后缀 再合并起来
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<stdlib.h>
#include<math.h>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<algorithm>
#include<numeric>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 505;
int pl[10005][maxn],pr[10005][maxn],pre[maxn];
int x[10005],y[10005];
void init(int n,int m)
{
for(int j = 0; j <= n; j++)
pl[0][j] = j;
for(int j = 0; j <= n; j++)
pr[m+1][j] = j;
}
int fid1(int x,int cnt)
{
if(pl[cnt][x] == x)
return x;
else
return pl[cnt][x] = fid1(pl[cnt][x],cnt);
}
void he1(int x,int y,int cnt)
{
int nx = fid1(x,cnt);
int ny = fid1(y,cnt);
if(nx != ny)
pl[cnt][nx] = ny;
}
int fid2(int x,int cnt)
{
if(pr[cnt][x] == x)
return x;
else
return pr[cnt][x] = fid2(pr[cnt][x],cnt);
}
void he2(int x,int y,int cnt)
{
int nx = fid2(x,cnt);
int ny = fid2(y,cnt);
if(nx != ny)
pr[cnt][nx] = ny;
}
int fid(int x)
{
if(pre[x] == x)
return x;
else
return pre[x] = fid(pre[x]);
}
void he(int x,int y)
{
int nx = fid(x);
int ny = fid(y);
if(nx != ny)
pre[nx] = ny;
}
int main(void)
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
init(n,m);
for(int i = 1; i <= m; i++)
scanf("%d%d",&x[i],&y[i]);
for(int i = 1; i <= m; i++)
{
for(int j = 1; j <= n; j++)
pl[i][j] = pl[i-1][j];
he1(x[i],y[i],i);
}
for(int i = m; i >= 1; i--)
{
for(int j = 1; j <= n; j++)
pr[i][j] = pr[i+1][j];
he2(x[i],y[i],i);
}
int t;
scanf("%d",&t);
while(t--)
{
int l,r;
scanf("%d%d",&l,&r);
for(int i = 1; i <= n; i++)
pre[i] = pl[l-1][i];
/*for(int i = 1; i <= n; i++)
printf("%d ",pl[l-1][i]);
putchar('\n');
for(int i = 1; i <= n; i++)
printf("%d ",pr[r+1][i]);
putchar('\n');*/
for(int i = 1; i <= n; i++)
{
he(fid2(i,r+1) ,fid(i));
}
int ans = 0;
for(int i = 1; i <= n; i++)
{
if(fid(i) == i)
ans++;
}
printf("%d\n",ans);
}
}
return 0;
}