zoukankan      html  css  js  c++  java
  • More is better

    Problem Description
    Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requirements.

    Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room immediately. There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Wang's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one boy left. Given all the direct friend-pairs, you should decide the best way.
     

    Input
    The first line of the input contains an integer n (0 ≤ n ≤ 100 000) - the number of direct friend-pairs. The following n lines each contains a pair of numbers A and B separated by a single space that suggests A and B are direct friends. (A ≠ B, 1 ≤ A, B ≤ 10000000)
     

    Output
    The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep. 
     

    Sample Input
    4 1 2 3 4 5 6 1 6 4 1 2 3 4 5 6 7 8
     

    Sample Output
    4 2
    Hint
    A and B are friends(direct or indirect), B and C are friends(direct or indirect), then A and C are also friends(indirect). In the first sample {1,2,5,6} is the result. In the second sample {1,2},{3,4},{5,6},{7,8} are four kinds of answers.
    求出最大集合的元素个数
    #include<cstdio>
    #include<cstring>
    int pre[10000001];
    int shu[10000001];
     int max;
    int find(int p)
    {
      int r=p;         
      while(r!=pre[r]) 
      r=pre[r]; 
      int i=p,j;      
      while(i!=r)
       {
       j=pre[i];pre[i]=r;i=j;
      }
     return r; 
    } 
    void dabiao()
    {
    	int i;
    	for(i=1;i<10000001;i++)
      {
      	pre[i]=i;
      	shu[i]=1;
      }
    }
    void merge(int x,int y)
    {
      
    	int fx=find(x);
    	int fy=find(y);
    	if(fx!=fy)
    	{
    		pre[fx]=fy; 
    	    shu[fy]=shu[fy]+shu[fx];
    	  if(max<shu[fy])
    	    {
    	     max=shu[fy];
    		}
    	}
    	
    }
    int main()
    {
    	
    	int n;
    	while(scanf("%d",&n)!=EOF)
    	{
             if(n==0)
             {
            printf("1
    ");
            continue;
    		 }
    		max=0;
    			dabiao();
    	   while(n--)
    	   {
    	   	    int u,v;
    	   	scanf("%d%d",&u,&v);
    	      merge(u,v);   
    	    }
    	  printf("%d
    ",max); 
    	  }
    	return 0;
     } 
    


    编程五分钟,调试两小时...
  • 相关阅读:
    2018 南京网络预赛Sum
    一个莫比乌斯等式的证明
    LOJ 2452 对称 Antisymmetry——用hash求回文串数
    LOJ 103子串查找——用hash代替kmp算法
    LOJ2823 三个朋友 ——查询字串的哈希值
    hash入门
    2019牛客暑期多校训练营(第十场)Coffee Chicken——递归
    2019牛客暑期多校训练营(第十场)Han Xin and His Troops——扩展中国剩余定理
    mutex 的 可重入
    Linux 编译安装Boost
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027108.html
Copyright © 2011-2022 走看看