题目1444:More is better
2017-04-25 17:56
344 查看
#include <stdio.h> #define max 10000010 int tree[max]; int people[max]; int findroot(int x) { if(tree[x]==-1) return x; else { int tap=findroot(tree[x]); tree[x]=tap; return tap; } } int main() { int n,a,b; while(scanf("%d",&n)!=EOF) { for (int i = 0; i < max; ++i) { tree[i]=-1; people[i]=1; } while(n--) { scanf("%d %d",&a,&b); a =findroot(a); b =findroot(b); if(a!=b) { tree[a]=b; people[b]+=people[a]; } } int people_max=0; int index=0; for (int i = 0; i < max; ++i) { if(people[i]>people_max) { people_max=people[i]; index=i; } } printf("%d\n",people_max); } return 0; } /************************************************************** Problem: 1444 User: cust123 Language: C++ Result: Accepted Time:880 ms Memory:79144 kb ****************************************************************/
相关文章推荐
- 题目1444:More is better
- 九度 题目1444:More is better
- 【九度】题目1444:More is better
- 【九度OJ】题目1444:More is better 解题报告
- 九度考研机试教程 67-题目1444:More is better
- 题目1444:More is better
- 题目1444:More is better
- 九度 题目1444:More is better
- 九度 题目1444:More is better
- 题目1444:More is better
- Jobdu 题目1444:More is better
- 题目67:More is better
- 九度 OJ 1444:More is better
- 九度OJ1444:More is better
- 九度OJ-1444:More is better(用并查集求集合大小)
- More is better
- F - More is better
- HDU1856_More is better
- HDU1856 More is better(并查集)
- hdu 1856 More is better