More is better
来源:互联网 发布:docker nginx负载均衡 编辑:程序博客网 时间:2024/06/05 04:29
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.
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.
41 23 45 61 641 23 45 67 8
42
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.
题意:这道题目的意思就是选出最大的集合, 也就是人最多的集合, 另外, 如果所有点都是孤立点, 也就是说所有人都互不认识, 那么答案显然就是1
题解:此题数据大,故查找根节点要优化路径。
#include<iostream>#include<algorithm>#define N 100005using namespace std;int maxn; int set[N];int num[N];void Init_set(){for(int i=1;i<=N;i++){set[i]=i;num[i]=1;}}int find(int x){int r=x;while(set[r]!=r)r=set[r];int i=x;while(i!=r){int j=set[i];set[i]=r;i=j;}return r;}int merge(int a,int b){a=find(a);b=find(b);if(a!=b){set[b]=a;num[a]+=num[b];maxn=max(maxn,num[a]);}return maxn;} int main(){int n;int a;int b;while(cin>>n){maxn=1;Init_set();for(int i=0;i<n;i++){cin>>a>>b;maxn=merge(a,b);}cout<<maxn<<endl;}return 0;}
阅读全文
0 0
- HDOJ More is better
- hdu More is better
- More is better
- HDU1856:More is better
- HDU1856--More is better
- hdu1856-More is better
- HDU1856:More is better
- hdu1856 More is better
- H - More is better
- More is better
- More is better
- More is better
- More is better
- C - More is better
- hdu1856 More is better
- More is better
- More is better 1856
- 2130:More is better
- UTF-8编码时,PHP如何正则匹配中文汉字?亲测可用
- python django 多级业务树形结构规划及页面渲染 概述: 在项目中,父级到子级结构并不少见,如果仅仅的两层树形结构,我们可以使用数据库的外键设计轻松做到,子级业务表设计一字段外键到父级
- Spring Boot干货:常用属性汇总
- 模线性方程组(中国剩余定理)
- Codeforces Round #382 (Div. 2)(A-D 未完)
- More is better
- NYOJ 63 小猴子下落
- 【Hadoop】之 实验一(过滤、合并文件)
- 矩阵快速幂 模板
- AndroidStudio如何引入so包
- docker 学习(1)
- HDU 6070 Dirt Ratio
- 排序之插入排序
- 八大排序算法之交换排序