【BZOJ1015 || JSOI2008】求联通块的个数

题面：给定一个无向图，求联通块的个数

用并查集是非常好做的

判代表元个数即可

进阶：给定一个无向图，求联通块个数。
每轮删除一个点，与之连接的边断开，输出联通块个数。

依然是并查集，不过要逆着做。

建图前只填加不删的点和必要的边，在每轮添加一个点，求出联通块个数，倒序输出即可。

http://61.187.179.132/JudgeOnline/problem.php?id=1015

#include <cstdio>
#include <iostream>
using namespace std;
 
const int maxn = 400000 + 5;
const int maxk = 400000 + 5;
 
int e = 0;
int n, m, k, p[maxk];
int a[maxn], b[maxn], c[maxk];
int vp[maxn], father[maxn], visit[maxn];
int point[maxn], next[maxn], edge[maxn];
 
void init(), work();
void addedge(int u, int v);
    
int main()
{
   init();
   work();
   return 0;
}
 
void addedge(int u, int v)
{
   ++e;
   point[e] = v; next[e] = edge[u]; edge[u] = e;
}
 
int find(int x)
{
   if (father[x] == x) return x;
   father[x] = find(father[x]);
   return father[x];
}
 
void init()
{
   cin >> n >> m;
   for (int i=1; i<=n; ++i)
      father[i] = i;
   for (int i=1; i<=m; ++i)
   {
      scanf("%d %d", &a[i], &b[i]);
      a[i] += 1; b[i] += 1;
      addedge(a[i], b[i]);
      addedge(b[i], a[i]);
   }
   cin >> k;
   for (int i=1; i<=k; ++i)
   {
      scanf("%d", &c[i]);
      c[i] += 1; vp[c[i]] = 1;
   }
}
 
void work()
{
   int sum = n - k;
   for (int i=1; i<=n; ++i)
      if (!vp[i])
      {
         int fi = find(i);
         for (int j=edge[i]; j; j=next[j])
            if (!vp[point[j]]) 
            {
               int fj = find(point[j]);
               if (fi != fj) 
               {
                  --sum;
                  father[fj] = fi;//错在father[fi] = f[j];
               }
            }
      }
   p[k + 1] = sum;
   for (int i=k; i>=1; --i)
   {
      ++sum;
      int fi = c[i];
      for (int j=edge[c[i]]; j; j=next[j])
         if (!vp[point[j]])
         {
            int fj = find(point[j]);
            if (fi != fj)
            {
               --sum;
               father[fj] = fi;//错在father[fj] = fi;
            }
         }
      p[i] = sum;
      vp[c[i]] = 0;
   }
   for (int i=1; i<=k+1; ++i)
      printf("%d\n", p[i]);
}  

数据送上

http://pan.baidu.com/share/link?shareid=7977&uk=2652110486