D - Ginger的操作序列 Ⅰ

这题限制用线性做法，比赛写了几发lazytag的线段树会内存超限，正解是 mrd并查集[狗头]。不过比赛时我的并查集没有压缩路径，感谢学长没有出数据卡我路径压缩。

ACcode 

#include <iostream>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <queue>
#include <bitset>
#include <vector>
#include <map>
#include <unordered_map>
//#define int long long
#define endl '\n'
#define lowbit(x) (x) & (-x)
#define mh(x) memset(x, -1, sizeof h)
#define debug(x) cerr << #x << "=" << x << endl;
#define brk exit(0);
using namespace std;
void TLE() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
const int N = 2e6 + 10;
const int M = 2 * N;
const int mod = 998244353;
const double esp = 1e-6;
const double pi = acos(-1);
typedef long long ll;
int p[N];
int find(int x)
{
    if(x!=p[x])
        p[x] = find(p[x]);
    return p[x];
}
signed main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n+1; i++)
        p[i] = i;
    while (m--)
    {
        int res = 0;
        int l, r;
        scanf("%d%d", &l, &r);
        for (int i = l; i <= r;)
        {
            if (p[i] == i)
            {
                res++;
                p[i] =find(r + 1);
                i++;
            }
            else
                i = p[i];
        }
        printf("%d\n", res);
    }

    return 0;
}