[ $\frak{Link}$]

詢問刪除前 $\mathfrak{i}$

#include<cstdio>
#include<iostream>
 

#include<algorithm>
#include<cstring>
#include<cmath>
#include<cctype>
#include<cstdlib>
using namespace std;
int n, m, tot;
int fa[10005];
int u[100005];
int v[100005];
int ans[100005];
int find(int x) {
    return fa[x] == x ? x : fa[x] = find(fa[x]);
}
void merge(int x, int y) {
    int fx = find(x);
    int fy = find(y);
    if (fx == fy) return;
    --tot;
    fa[fx] = fy;
}
int main() {
    while (~scanf("%d%d", &n, &m)) {
   		tot = n;
    	for (int i = 0; i < n; ++i) {
        	fa[i] = i;
    	} 
    	for (int i = 1; i <= m; ++i) {
    	    scanf("%d%d", &u[i], &v[i]);
    	}
    	for (int i = m; i > 1; --i) {
    	    merge(u[i], v[i]);
    	    ans[i] = tot;
    	}
    	for (int i = 2; i <= m; ++i) {
    	    printf("%d\n", ans[i]);
    	}
    	printf("%d\n", n);
	}
    return 0;
}