hdu 1856 More is better
来源:互联网 发布:淘宝失效宝贝怎找店家 编辑:程序博客网 时间:2024/06/12 00:41
题目:
链接:点击打开链接
题意:
给出n个直接认识的朋友,最大的直接或间接认识的朋友。
思路:
算法:
并查集,,,
代码:
#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define MAXN 100010int root[MAXN];int member[MAXN];//表示在i结点处的,认识的朋友int find(int x){ return x == root[x] ? x : root[x] = find( root[x] );}void merge(int x,int y){ int fx = find(x); int fy = find(y); if(fx != fy) { root[fx] = fy; member[fy] += member[fx]; }}int main(){ //freopen("input.txt","r",stdin); int n,a,b; int fa,maxn; while(scanf("%d",&n) != EOF) { for(int i=0; i<MAXN; i++) { root[i] = i; member[i] = 1; } fa = 1; for(int i=0; i<n; i++) { scanf("%d%d",&a,&b); if(a>fa || b>fa) fa = max(a,b); merge(a,b); } maxn = 0; for(int i=1; i<=fa; i++) { if(member[i] > maxn) maxn = member[i]; } printf("%d\n",maxn); } return 0;}
0 0
- hdu 1856 More is better
- HDU 1856 more is better
- Hdu-1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu-1856 More is better
- vijos P1352 最大获利(最小割)
- MFC 对话框中添加ACTIVEX后失败的问题
- android屏幕分类与屏幕相关参数定义
- 基于注解的Spring MVC整合Hibernate(所需jar包,spring和Hibernate整合配置,springMVC配置,重定向,批量删除)
- C++中的析构函数
- hdu 1856 More is better
- Google Maps Android API V2的使用
- cocos2d-x3.0的touch事件
- Linux 下解压与压缩rar包
- 各种CCMenu的使用
- hdu2099
- 最速下降法/steepest descent,牛顿法/newton,共轭方向法/conjugate direction,共轭梯度法/conjugate gradient 及其他
- IJ整理
- 使用SharedPreferences保存登陆账号和密码