九度OJ1444:More is better
来源:互联网 发布:双色球九转连环图软件 编辑:程序博客网 时间:2024/06/16 06:24
- 题目描述:
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
- 样例输出:
42
#include<iostream>#include<cstdio> using namespace std;#define N 10000001int Tree[N]; int findRoot(int x){ if(Tree[x] == -1){ return x; } else{ int tmp = findRoot(Tree[x]); Tree[x] = tmp; return tmp; }}int sum[N];int main(){ int n, a, b; //int sum[N]; while(scanf("%d", &n) != EOF){ for(int i = 0; i < N; i++){ Tree[i] = -1; sum[i] = 1; } while(n--){ scanf("%d %d", &a, &b); int ra = findRoot(a); int rb = findRoot(b); if(ra != rb){ sum[rb] += sum[ra]; Tree[ra] = rb; } } int ans = 1; for(int i = 1; i < N; i++){ if(Tree[i] == -1 && sum[i] > ans) ans = sum[i]; } printf("%d\n", ans); } return 0;} /************************************************************** Problem: 1444 User: various Language: C++ Result: Accepted Time:970 ms Memory:79644 kb****************************************************************/
当我把int sum[N];放在main函数里会出现RE,,暂时不知道为什么,如果有哪位大神知道,可否联系下我,谢谢!
- 九度OJ1444:More is better
- 【九度】题目1444:More is better
- 九度 题目1444:More is better
- 九度 题目1444:More is better
- 九度 OJ 1444:More is better
- 九度 题目1444:More is better
- 九度oj 题目1444:More is better
- 【九度OJ】题目1444:More is better 解题报告
- 九度考研机试教程 67-题目1444:More is better
- 九度OJ-1444:More is better(用并查集求集合大小)
- 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
- 网络流增广路入门很好的文章
- [刷题]Sqrt(x)
- FreeMarker标签与使用
- 1093. Count PAT's (25)
- PyQt创建VTK
- 九度OJ1444:More is better
- Xilinx ZYNQ-7z020 Platform 生成boot.bin自动从SPI Flash加载程序
- NSString的copy 属性
- 转载 Visual Assist X 10.8.2001 破解版 支持VC2013及以下版本
- HTML与XML的优缺点
- 2015秋季腾讯【技术运营】岗位———在线笔试总结
- IE浏览器请求json数据弹出下载框问题
- Zombie僵尸进程发现,查找,追踪,杀死,避免
- 智力类笔试题基础(第一篇