HDU 1213: How Many Tables (in Java)

标签：size   auth   ++   out   problem   style   back   nbsp   ref   

/**
 * @link http://acm.hdu.edu.cn/showproblem.php?pid=1213
 * @author Sycamore
 * @date Aug, 18
 */
import java.util.*;

class Main{
   static int []parent=new int[1001];
   static int find(int x)
   {
      return parent[x]=x==parent[x]?x:find(parent[x]);
   }
   static void Union(int x,int y)
   {
      parent[find(x)]=find(y);
   }
    public static void main(String args[]){
        Scanner scanner=new Scanner(System.in);
        int T=scanner.nextInt();
        while(T--!=0)
        {
           int n=scanner.nextInt(),m=scanner.nextInt();
           for(int i=1;i<=n;i++)parent[i]=i;
           for(int i=0;i<m;i++)
           {
              int a=scanner.nextInt(),b=scanner.nextInt();
            Union(a,b);
           }
           int cnt=0;
           for(int i=1;i<=n;i++)
              if(parent[i]==i)
                 ++cnt;
           System.out.println(cnt);
        }
        scanner.close();
    }
}

HDU 1213: How Many Tables (in Java)

标签：size   auth   ++   out   problem   style   back   nbsp   ref   

原文地址：http://www.cnblogs.com/zjnu/p/7392340.html