點擊打開鏈接

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.?
InputThe 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) OutputThe 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 2

暴力枚舉，中間有一小部分的優化

把連在一起的通過join連接在一起然后通過枚舉有都少個孩子節點有相同的父親

Select Code

#include<cstdio> #include<cstring> #include<algorithm> using namespace std;int par[10000005]; void init(int n) {for(int i=1; i<=10000005; i++)par[i]=i; }int find(int x) {if(par[x]==x)return x;elsereturn par[x]=find(par[x]); }void join(int x, int y) {int fx=find(x),fy=find(y);if(fx!=fy){par[fx]=fy;} } int main() {int n;while(~scanf("%d",&n)){ if(n==0) //特判？？？？ {printf("1\n");continue;} init(n);int maxn=0;for(int i=1; i<=n; i++){int a,b;scanf("%d%d",&a,&b);join(a,b);if(max(a,b)>maxn) //優化 {maxn=max(a,b) ;} }int sum=0,ans=0; for(int j=1; j<=maxn; j++){int ans=0; if(par[j]==j)for(int i=1; i<=maxn; i++){if(find(i)==j) //find（i）與par[i]不同？？ ans++;}sum=max(sum,ans); }printf("%d\n",sum); }return 0; }

轉載于:https://www.cnblogs.com/ruruozhenhao/p/7406507.html

總結

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

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