More is better
来源:互联网 发布:知乎周刊plus重拾英语 编辑:程序博客网 时间:2024/04/28 03:40
More is better
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<stdio.h>#include<algorithm>#include<math.h>#define N 10000010using namespace std;int pre[N],num[N],i;int find(int x){ if(x!=pre[x]) { pre[x]=find(pre[x]); } return pre[x];}void join(int x,int y){ int fx=find(x),fy=find(y); if(fx!=fy) { pre[fy]=fx; num[fx]+=num[fy]; } } void cs(){ for(i=1;i<N;i++) { pre[i]=i; num[i]=1; }}int main(){ int n,a,b,Max,sum; while(scanf("%d",&n)!=EOF) { cs(); if(n==0) { printf("1\n"); continue; } Max=0; for(i=0;i<n;i++) { scanf("%d%d",&a,&b); join(a,b); Max=max(Max,max(a,b)); } sum=0; for(i=0;i<Max;i++) { if(sum<num[i]) sum=num[i]; } printf("%d\n",sum); } return 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
- 一分耕耘一分收获
- 掌握MySQL如何使用临时表,避免踩中性能地雷
- tjut 1556
- Android
- figure新标签的应用
- More is better
- POJ 3026 Borg Maze (bfs+prim)
- POST方法 和 GET方法
- POJ 2553 - The Bottom of a Graph(Tarjan + 缩点 + 计算出度)
- CopyOnWriteArrayList与Collections.synchronizedList的性能对比
- Java Web学习(30): Servlet学习(三)
- 【NAS】NFS客户端挂载目录后无写入权限的解放方案
- led与普通灯的区别
- 关于困扰我很多次的matlab编程小问题