zoukankan      html  css  js  c++  java
  • UVA 10608 Friends

    很水的并查集

    #include <map>
    #include <set>
    #include <list>
    #include <cmath>
    #include <ctime>
    #include <deque>
    #include <stack>
    #include <queue>
    #include <cctype>
    #include <cstdio>
    #include <string>
    #include <vector>
    #include <climits>
    #include <cstdlib>
    #include <cstring>
    #include <iostream>
    #include <algorithm>
    #define LL long long
    #define PI 3.1415926535897932626
    using namespace std;
    int gcd(int a, int b) {return a % b == 0 ? b : gcd(b, a % b);}
    #define MAXN 30010
    int N,M;
    int p[MAXN],num[MAXN];
    int Find(int x) {return x == p[x] ? x : p[x] = Find(p[x]);}
    int main()
    {
        //freopen("sample.txt","r",stdin);
        int T;
        scanf("%d",&T);
        while (T--)
        {
            scanf("%d%d",&N,&M);
            int ans = 0;
            for (int i = 0; i <= N; i++) {p[i] = i; num[i] = 1;}
            while (M--)
            {
                int u,v;
                scanf("%d%d",&u,&v);
                int x = Find(u);
                int y = Find(v);
                if (x != y)
                {
                    if (num[x] > num[y])
                    {
                        p[y] = x;
                        num[x] += num[y];
                    }
                    else
                    {
                        p[x] = y;
                        num[y] += num[x];
                    }
                    ans = max(ans,max(num[x],num[y]));
                }
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    JQ选择器
    设计模式
    招银网络面试
    斗鱼面经
    招银科技面经
    用户访问网站基本流程
    shell的条件判断
    crontab -e 和/etc/crontab的区别
    秘钥对登录配置
    CentOS6 x86_64最小化安装优化脚本
  • 原文地址:https://www.cnblogs.com/Commence/p/4024221.html
Copyright © 2011-2022 走看看