More is better
来源:互联网 发布:c语言中fabs函数 编辑:程序博客网 时间:2024/06/07 22:26
More is better
Time Limit:1000MS Memory Limit:102400KB 64bit IO Format:%I64d & %I64u
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.
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
41 23 45 61 641 23 45 67 8
Sample Output
42
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<iostream>#include<algorithm>#include<cstring>#include<cmath>#define MAXN 10000005using namespace std;int s[MAXN],sum[MAXN],pp;void init();void make(int a,int b);int find(int x);int main(){ int n; while(scanf("%d",&n)!=EOF) { pp=0; init(); while(n--) { int a,b; scanf("%d%d",&a,&b); make(a,b); } printf("%d\n",pp); }}void init (){ for(int i=1;i<=MAXN;i++) { s[i]=i; sum[i]=1; }}int find(int x){ return s[x]==x?x:find(s[x]);}void make(int a,int b){ a=find(a); b=find(b); if(a==b) return; if(sum[a]>=sum[b]) { s[b]=a; sum[a]+=sum[b]; if(sum[a]>pp) pp=sum[a]; } else { s[a]=b; sum[b]+=sum[a]; if(sum[b]>pp) pp=sum[b]; }}
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
- 多个按钮单击事件
- 编写程序计算Hermite Polynomials(厄密多项式)
- Java中equals和==的区别
- 由边判断三角形类型
- 左驱动非分区表数据量变化影响分区查询执行计划变形分析!
- More is better
- Codeforces Round #286 (Div. 2) C. Mr. Kitayuta, the Treasure Hunter
- Apache POI 设置宽度和行高
- 【转】win32平台TCP网络通信模块客户端
- Mac Eclipse 中找不到 Installed Jre
- win7 64bit上创建Android开发环境
- OpenGL学习——第二课:第一个OpenGL程序
- 猜数字游戏和自由落体高度
- 金蝶K3常用数据表(整理)