Codeforces Round #600 (Div. 2) D Harmonious Graph（bfs或并查集）

题意就是：给你n个节点和m条边的无向图，定义一个图如果和谐的话假如L到R直接有边的话，那么L到L和R之间的节点都得可以到达。

比如第一组样例1到7直接可以到达，但是1到3,4,6折三个点都不能到达，我们只需要加一条边1——6就可以使得这个图和谐。

我看题解很多人都是并查集来做的，我是用的bfs先每个点遍历找到一个端点可以连到的最远点，找直接不能连通的点然后答案+1，然后更新点的连通性就行了。

AC代码：

#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define pd(n) printf("%d\n", (n))
#define pdd(n,m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n,m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mod(x) ((x)%MOD)
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x&-x)
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const int maxn = 3e5 + 5;
const int INF = 0x3f3f3f3f;
inline int read()
{
    int ret = 0, sgn = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9')
    {
        if(ch == '-')
            sgn = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        ret = ret*10 + ch - '0';
        ch = getchar();
    }
    return ret*sgn;
}
inline void Out(int a)    //Êä³öÍâ¹Ò
{
    if(a>9)
        Out(a/10);
    putchar(a%10+'0');
}

int qpow(int m, int k, int mod)
{
    int res = 1, t = m;
    while (k)
    {
        if (k&1)
            res = res * t % mod;
        t = t * t % mod;
        k >>= 1;
    }
    return res;
}

int t;
int n,m;
int i,j,k;
const int N = 2e5 + 5;
int maxx=0,vis[N];
int u,v;
struct node
{
    int v,nxt;
} e[N<<1];
int head[N], ans=0;
void add(int u, int v)
{
    e[++ans].v=v;
    e[ans].nxt=head[u];
    head[u]=ans;
}

void bfs(int x)
{
    vis[x]=1;
    maxx=max(maxx, x);
    queue<int> q;
    q.push(x);
    while(q.size())
    {
        int u=q.front();
        q.pop();
        for(int i=head[u]; i; i=e[i].nxt)
        {
            int v=e[i].v;
            if(vis[v])
                continue;
            q.push(v);///之间有边的节点
            vis[v]=1;
            maxx=max(maxx, v);///选择最远的节点
        }
    }
}
ll slove(int res)
{
    ll ans=0;
    bfs(res);
    for(int i=res+1; i<maxx; i++)///当前端到最远的点
    {
        if(!vis[i])
        {
            ++ans;///没边就+1
            bfs(i);///更新点的连通性
        }
    }
    return ans;
}

int  main()
{
    scanf("%d %d", &n, &m);
    for(i=1; i<=m; i++)
    {
        scanf("%d %d", &u, &v);
        add(u, v);
        add(v, u);
    }
    ll ans=0;
    for(i=1; i<=n; i++)
    {
        if(!vis[i])
        {
            ans+=slove(i);
        }
    }
    printf("%lld\n",ans);
    return 0;
}

并查集版本：

#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define pd(n) printf("%d\n", (n))
#define pdd(n,m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n,m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mod(x) ((x)%MOD)
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x&-x)
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const int maxn = 3e5 + 5;
const int INF = 0x3f3f3f3f;
inline int read()
{
    int ret = 0, sgn = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9')
    {
        if(ch == '-')
            sgn = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        ret = ret*10 + ch - '0';
        ch = getchar();
    }
    return ret*sgn;
}
inline void Out(int a)    //Êä³öÍâ¹Ò
{
    if(a>9)
        Out(a/10);
    putchar(a%10+'0');
}

int qpow(int m, int k, int mod)
{
    int res = 1, t = m;
    while (k)
    {
        if (k&1)
            res = res * t % mod;
        t = t * t % mod;
        k >>= 1;
    }
    return res;
}

int n, m, a, b, x, y, ans;
int pre[200005];

void init(int n)
{
    for(int i = 1; i <= n; i++)
        pre[i] = i;
}

int Find(int x)
{
    if(pre[x] == x)
        return x;
    else
        return pre[x] = Find(pre[x]);
}

// 并查集解法
int main()
{
    scanf("%d %d", &n, &m);
    init(n);
    for(int i = 0; i < m; i++)
    {
        scanf("%d %d", &a, &b);
        x = Find(a);
        y = Find(b);
        // 把点大的都做树的根节点
        if(x > y)
            swap(x, y);
        pre[x] = y;
    }

    for(int i = 1; i <= n; i++)
    {
        x = Find(i);      // Find函数已包含路径压缩
        while(i < x)
        {
            y = Find(i);
            if(x != y)  // 不在一个区间里 合并
            {
                ans++;  // 路径 ++
                // 把点大的做树的根节点
                if(y > x)
                    swap(x, y);
                pre[y] = x;
            }
            i++;
        }
    }
    printf("%d\n", ans);
    return 0;
}