HDU4496(并差集)

　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　A - D-City

　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　Time Limit:1000MS   
　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　Memory Limit:65535KB  
　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　　 64bit IO Format:%I64d 

Description

Luxer is a really bad guy. He destroys everything he met.
One day Luxer went to D-city. D-city has N D-points and M D-lines. Each D-line connects exactly two D-points. Luxer will destroy all the D-lines. The mayor of D-city wants to know how many connected blocks of D-city left after Luxer destroying the first K D-lines in the input.
Two points are in the same connected blocks if and only if they connect to each other directly or indirectly.

 

Input

First line of the input contains two integers N and M.
Then following M lines each containing 2 space-separated integers u and v, which denotes an D-line.
Constraints:
0 < N <= 10000
0 < M <= 100000
0 <= u, v < N.

 

Output

Output M lines, the ith line is the answer after deleting the first i edges in the input.

 

Sample Input

    
    

     
     5 10 
0 1 
1 2 
1 3 
1 4 
0 2 
2 3 
0 4 
0 3 
3 4 
2 4 
    
    

 

Sample Output

    
    

     
     1 
1 
1 
2 
2 
2 
2 
3 
4 
5 
    
    

Hint

 The graph given in sample input is a complete graph, that each pair of vertex has an edge connecting them, so there's only 1 
connected block at first. The first 3 lines of output are 1s because after deleting the first 3 edges of the graph, all vertexes 
still connected together. But after deleting the first 4 edges of the graph, vertex 1 will be disconnected with other vertex, and it 
became an independent connected block. Continue deleting edges the disconnected blocks increased and finally it will became the number
of vertex, so the last output should always be N. 
         

 

题目描述：给出一个有N（0<N<=10000）个顶点的无向图,然后依次给出它的M（0<M<=100000）条边，要求依次输出当删除给出的前k（0<K<=M）条边后，该图的连通分量总数。

输入：第一行是N和M，然后是M行数（X,Y）（0<=X,Y<N）表示X与Y有边。

输出：依次输出所求的连通分量数。

分析：当删除前K条边时图所剩的连通分量数就是N个孤立的点只添加后M-K跳边时，所具有的连通分量数。

所以仅需倒叙插入每条边，分别保存插入边后有的连通分量数在数组内，然后输出数组即可。

AC代码中未加while(scanf("%d%d",&n,&m)==2)这行而直接用scanf("%d%d",&n,&m)；就得到wrong的结果。

连通：在无向图中，如果从顶点vi到顶点vj有路径，则称vi和vj连通。如果图中任意两个顶点之间都连通，则称该图为连通图，否则，称该图为非连通图，则其中的极大连通子图称为连通分量，这里所谓的极大是指子图中包含的顶点个数极大。

#include <iostream>
#include <cstdio>
#include <cstring>
#define M 100000+10
#define N 10000+10
using namespace std;
int n,m;
struct node
{
  int u,v;
} edge[M];
int B[N],ans[M];
int fine(int x)//查找元素所在的集合,即根节点。
{
  if(B[x]!=x)
  B[x]=fine(B[x]);//递归向上找，当自己是自己的父节点，说明该节点为根节点
  return B[x];
}
int main()
{
  int i;
  while(~scanf("%d%d",&n,&m))
  {
  memset(ans,0,sizeof(ans));
  memset(edge,0,sizeof(edge));
    for(i=0;i<n;i++)//定义一个数组，使得B[x]存的就是x的父节点。
    B[i]=i;
    for(i=0; i<m; i++)
    {
      scanf("%d%d",&edge[i].u,&edge[i].v);
    }
    int sum=n;
    for(i=m-1;i>=0;i--)
    {
      ans[i]=sum;
      int m_x=fine(edge[i].u);
      int m_y=fine(edge[i].v);
      if(m_x!=m_y)//将两个元素所在的集合合并为一个集合。
      {
        sum--;
        B[m_x]=m_y;
      }
    }
    for(i=0;i<m;i++)
    printf("%d\n",ans[i]);
  }
  return 0;
}