把摧毁转换成修建,逆序修建保存摧毁前的联通块,再正序输出就是答案了。
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
const int maxn = 4e5 + 5;
int n, m, k, num, len[maxn],c[maxn];
int f[maxn], st[maxn], ans[maxn];
struct Tunnel {
int x, y, l;
Tunnel(int x, int y, int l) :x(x), y(y), l(l) {}
Tunnel() {}
}a[maxn];
int find(int x) {
if (f[x] == x)
return x;
return f[x] = find(f[x]);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
f[i] = i;
int x, y;
for (int i = 1; i <= m; i++) {
scanf("%d%d", &x, &y);
x++; y++;
a[(i << 1) - 1] = Tunnel(x, y, len[x]);
len[x] = (i << 1) - 1;
a[i << 1] = Tunnel(y, x, len[y]);
len[y] = i << 1;
}
scanf("%d", &k);
for (int i = 1; i <= k; i++) {
scanf("%d", &st[i]);
st[i]++;
c[st[i]] = 1;
}
for (int i = 1; i <= (m << 1); i++)
if (!c[a[i].x] && !c[a[i].y])
f[find(a[i].x)] = find(a[i].y);
for (int i = 1; i <= n; i++)
if (!c[i] && f[i] == i)
num++;
ans[k] = num;
for (int i = k; i > 0; i--) {
num++;
c[st[i]] = 0;
for (int j = len[st[i]]; j > 0; j = a[j].l) {
int p = find(a[j].x), q = find(a[j].y);
if (!c[a[j].y]) {
if (p != q)
num--;
f[p] = q;
}
}
ans[i - 1] = num;
}
for (int i = 0; i <= k; i++)
printf("%d\n", ans[i]);
system("pause");
return 0;
}