九度oj 1444
来源:互联网 发布:windows10看mac地址 编辑:程序博客网 时间:2024/05/29 11:01
- 题目描述:
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.
- 输入:
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)
- 输出:
The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
- 样例输入:
41 23 45 61 641 23 45 67 8
- 样例输出:
4
2
#include<iostream>#include<stdio.h>using namespace std;#define N 10000001int tree[N];int findroot(int x){ if(tree[x]==-1) return x; else return findroot(tree[x]);}int sum[N];int main(){ int n; while(cin>>n) { memset(tree,-1,sizeof(tree)); for(int i=1;i<N;i++) { tree[i]==-1; sum[i]=1; } while(n--!=0) { int a,b; cin>>a>>b; a=findroot(a); b=findroot(b); if(a!=b) { tree[a]=b; sum[b]+=sum[a]; } } int ans=1; for(int i=1;i<=N;i++) { if(tree[i]==-1&&sum[i]>ans) { ans=sum[i];} } cout<<ans<<endl; } }
- 九度oj 1444
- 【九度OJ】:九度OJ 1050
- 【九度OJ】:九度OJ 1053
- 【九度OJ】:九度OJ 1056
- 【九度OJ】:九度OJ 1059
- 【九度OJ】:九度OJ 1206
- 九度 OJ 1444:More is better
- 九度OJ:1000
- 【九度OJ】 1006
- 九度 OJ 1499
- 九度OJ-1002
- 九度OJ-1003
- 九度OJ 1004
- 九度OJ 1003
- 九度oj 采药
- 九度OJ 1001
- 九度OJ 1015
- 九度oj 1972
- EFCode First 导航属性
- mysql 数据库分区
- 探索angular源码--启动(1)
- 【Android归纳】Asynctask与Handler异步综述
- Android中获取应用程序(包)的信息-----PackageManager的使用(一)
- 九度oj 1444
- 笔试题:09年_atoi
- C#中Using用法
- 把线性方程组变系数矩阵和常量形式
- 公交车比喻
- linux进程一章知识总结
- 黑马程序员------网络编程(TCP&UDP)
- Rails 极简入门笔记
- Leetcode #228 Summary Ranges