题意:一个无向图,给出m条边,有k次询问,每次询问将第l到r条边暂时删去,求这时候有多少个连通分量。
思路;首先预处理,分别从前往后和从后往前合并,从前往后的并查集用s[i]表示,代表从第1条边到第i条边的并查集,从后往前用l[i]表示,代表从第i条边到第m条边的并查集;每次询问,要将两个并查集合并,然后再求出连通分量的个数。
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <queue>
#include <map>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-3
#define maxn 100010
#define MOD 1000000007
int u[10010],v[10010];
int n,m;
struct node
{
int fa[550];
void init()
{
for(int i = 0; i < 550; i++)
fa[i] = i;
}
int Find(int x)
{
return fa[x] = fa[x] == x?x:Find(fa[x]);
}
void Union(int x,int y)
{
int fx = Find(x);
int fy = Find(y);
if(fx != fy)
fa[fy] = fx;
}
}s[10010],l[10010];
int slove(node left,node right)
{
int ans = 0;
for(int i = 1; i <= n; i++)
right.Union(i,left.Find(i));
for(int i = 1; i <= n; i++)
if(right.Find(i) == i)
ans++; //求联通分量的方法很巧妙
return ans;
}
int main()
{
int t,C = 1;
//scanf("%d",&t);
while(scanf("%d%d",&n,&m) != EOF)
{
for(int i = 1; i <= m; i++)
scanf("%d%d",&u[i],&v[i]);
s[0].init();
l[m+1].init();
for(int i = 1; i <= m; i++)
{
s[i] = s[i-1];
s[i].Union(u[i],v[i]);
}
for(int i = m; i >= 1; i--)
{
l[i] = l[i+1];
l[i].Union(u[i],v[i]);
}
int k;
scanf("%d",&k);
while(k--)
{
int x,y;
scanf("%d%d",&x,&y);
printf("%d\n",slove(s[x-1],l[y+1]));
}
}
}