求大神指點杭電1586more is better,答案對，就是超時(⊙o⊙)求指點

?

More is better

Time Limit: 5000/1000 MS (Java/Others)????Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 19936????Accepted Submission(s): 7313


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.

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 <iostream> using namespace std; int arr[10000001] ; int num[10000001] ; int Max; inline int find(int r) {while(r!=arr[r])r=arr[r];return r; } inline void judge(int a,int b) {int x,y;x=find(a);y=find(b);if(x!=y){arr[y]=x;num[x]=num[y]+num[x];num[y]=num[x];if(num[y]>Max)Max=num[y];}? ?? } inline void Init() {for(int i=1;i<= 10000001 ;i++){arr[i]=i;num[i]=1;} } int main() {int N,a,b;while (cin>>N){Init();Max=num[1];while(N--){cin>>a>>b;judge(a, b);}cout<<Max<<endl;}return 0; }

?

總結

以上是生活随笔為你收集整理的杭电1856More is better的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。