More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 18620 Accepted Submission(s): 6850
Problem 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
4 1 2 3 4 5 6 1 6 4 1 2 3 4 5 6 7 8
Sample Output
4 2HintA 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 <cstdlib> #include <cstring> #define maxn 100000+10 using namespace std; int pre[maxn]; int vis[maxn]; int flag[maxn]; int sum; int find(int x) { int a=x,b; while(a!=pre[a]) a=pre[a]; while(x!=a) { b=pre[x]; pre[x]=a; x=b; } return a; } void join(int a,int b) { int fa=find(a); int fb=find(b); if(fa!=fb) { pre[fa]=fb; flag[fb]+=flag[fa];//学长教的方法 sum = max(sum,flag[fb]);//在这里直接比较记录最大值 } } int main() { int n,a,b; while(~scanf("%d",&n)) { sum = 0; if(n==0) { printf("1\n"); continue; } for(int i=1;i<=100010;++i) { pre[i]=i; vis[i]=0; flag[i]=1; } while(n--) { scanf("%d %d",&a,&b); join(a,b); vis[a]=1; vis[b]=1; } // int maxi=0;//自己的比较笨的方法,,不好意思贴都。。。。 // for(int i=1;i<=10000000;++i) // { // int cnt=0; // if(vis[i]&&pre[i]==i) // { // for(int j=1;j<10000000;++j) // { // if(vis[j]&&find(j)==i)cnt++; // } // } // if(cnt>maxi) // maxi=cnt; // } // sort(flag+1,flag+10000001,cmp); printf("%d\n",sum); } return 0; }