区间众数，强制在线 [分块]

区间众数

1. 先离散化数据，将每个数据都放到对应的桶里(vector)，并记下排名。
2. 再预处理一个cnt[i][j]表示第i个块到第j个块中的众数是多少，同时也可以记下众数是什么。
3. 对于每一个[l,r]，ans开始是cnt[bel[l]+1][bel[r]-1]为中间块的众数。
4. 对于左边上的数字，在其对应的vector中找从他开始往后ans个数的位置是否<=r(首先要保证有后ans个数)，如果有则++ans。
5. 对于右边上的数字，在其对应的vector中找从他开始往前ans个数的位置是否>=l(首先要保证有前ans个数)，如果有则++ans

练习

P5048 [Ynoi2019模拟赛]Yuno loves sqrt technology III

#include <bits/stdc++.h>
#define enter putchar('\n')
#define space putchar(' ')
#define pb(x) push_back(x)
#define mid ((l + r) >> 1)
#define lc (p << 1)
#define rc (p << 1 | 1)
#define ll long long
#define jh(x, y) (x ^= y, y ^= x, x ^= y)
using namespace std;
template <class T> inline void read(T &x) {
    x = 0; T f = 1; char ch = getchar();
    while (!(ch >= '0' && ch <= '9')) {if (ch == '-') f = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
    x *= f;
}
template <class T> inline void write(T x) {
    if (x < 0) x = -x, putchar('-');
    if (x / 10) write(x / 10);
    putchar('0' + x % 10);
}
template <class T> inline void Max(T &x, T y) {if (y > x) x = y;}
template <class T> inline void Min(T &x, T y) {if (y < x) x = y;}
const int MAX = 0x7fffffff;
const int MIN = 0x80000000;
const int INF = 0x3f3f3f3f;
//----------------------------------------------------------------
const int N = 5e5 + 10;
const int M = 720;
int n, m, a[N], b[N], blo, bel[N], lnk[N], sum[N], cnt[M][M], ans;
vector<int> ve[N];
int main() {
    read(n), read(m); blo = sqrt(n);
    for (int i = 1; i <= n; i++) bel[i] = (i - 1) / blo + 1;
    for (int i = 1; i <= n; i++) read(a[i]), b[++*b] = a[i];
    sort(b + 1, b + 1 + *b);
    *b = unique(b + 1, b + 1 + *b) - b - 1;
    for (int i = 1; i <= n; i++) {
        a[i] = lower_bound(b + 1, b + 1 + *b, a[i]) - b;
        ve[a[i]].pb(i);
        lnk[i] = ve[a[i]].size() - 1;
    }
    for (int i = 1; i <= bel[n]; i++) {
        memset(sum, 0, sizeof(sum));
        for (int j = i; j <= bel[n]; j++) {
            cnt[i][j] = cnt[i][j - 1];
            int l = (j - 1) * blo + 1, r = min(j * blo, n);
            for (int k = l; k <= r; k++) Max(cnt[i][j], ++sum[a[k]]);
        }
    }
    for (int i = 1; i <= m; i++) {
        int l, r; read(l), read(r); l ^= ans, r ^= ans;
        l %= n + 1, r %= n + 1; if (l > r) jh(l, r);
        ans = cnt[bel[l] + 1][bel[r] - 1];
        for (int j = l, lim = min(bel[l] * blo, r); j <= lim; j++)
            while (lnk[j] + ans < (int)ve[a[j]].size() && ve[a[j]][lnk[j] + ans] <= r) ++ans;
        if (bel[l] != bel[r]) for (int j = (bel[r] - 1) * blo + 1; j <= r; j++)
            while (lnk[j] - ans >= 0 && ve[a[j]][lnk[j] - ans] >= l) ++ans;
        write(ans); enter;
    }
    return 0;
}

P4168 [Violet]蒲公英

#include <bits/stdc++.h>
#define enter putchar('\n')
#define space putchar(' ')
#define pb(x) push_back(x)
#define mid ((l + r) >> 1)
#define lc (p << 1)
#define rc (p << 1 | 1)
#define ll long long
#define jh(x, y) (x ^= y, y ^= x, x ^= y)
using namespace std;
template <class T> inline void read(T &x) {
    x = 0; T f = 1; char ch = getchar();
    while (!(ch >= '0' && ch <= '9')) {if (ch == '-') f = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
    x *= f;
}
template <class T> inline void write(T x) {
    if (x < 0) x = -x, putchar('-');
    if (x / 10) write(x / 10);
    putchar('0' + x % 10);
}
template <class T> inline void Max(T &x, T y) {if (y > x) x = y;}
template <class T> inline void Min(T &x, T y) {if (y < x) x = y;}
const int MAX = 0x7fffffff;
const int MIN = 0x80000000;
const int INF = 0x3f3f3f3f;
//----------------------------------------------------------------
const int N = 4e4 + 10;
const int M = 500 + 10;
int n, m, a[N], b[N], blo, bel[N], lnk[N], sum[N], cnt[M][M], idx[M][M], last;
vector<int> ve[N];
int main() {
    read(n), read(m); blo=min(n*1.0,max(10.0,ceil(sqrt(n)/2.0)));
    for (int i = 1; i <= n; i++) bel[i] = (i - 1) / blo + 1;
    for (int i = 1; i <= n; i++) read(a[i]), b[++*b] = a[i];
    sort(b + 1, b + 1 + *b);
    *b = unique(b + 1, b + 1 + *b) - b - 1;
    for (int i = 1; i <= n; i++) {
        a[i] = lower_bound(b + 1, b + 1 + *b, a[i]) - b;
        ve[a[i]].pb(i);
        lnk[i] = ve[a[i]].size() - 1;
    }
    for (int i = 1; i <= bel[n]; i++) {
        memset(sum, 0, sizeof(sum));
        for (int j = i; j <= bel[n]; j++) {
            cnt[i][j] = cnt[i][j - 1]; idx[i][j] = idx[i][j - 1];
            int l = (j - 1) * blo + 1, r = min(j * blo, n);
            for (int k = l; k <= r; k++) {
                ++sum[a[k]];
                if (sum[a[k]] > cnt[i][j])
                    cnt[i][j] = sum[a[k]], idx[i][j] = a[k];
                else if (sum[a[k]] == cnt[i][j] && idx[i][j] > a[k])
                    idx[i][j] = a[k];
            }
        }
    }
    for (int i = 1; i <= m; i++) {
        int l, r; read(l), read(r); l = (l + last - 1) % n + 1, r = (r + last - 1) % n + 1;
        if (l > r) jh(l, r);
        int mx = cnt[bel[l] + 1][bel[r] - 1], ans = idx[bel[l] + 1][bel[r] - 1];
        for (int j = l, lim = min(bel[l] * blo, r); j <= lim; j++) {
            while (lnk[j] + mx < (int)ve[a[j]].size() && ve[a[j]][lnk[j] + mx] <= r) ++mx, ans = a[j];
            if (lnk[j] + mx <= (int)ve[a[j]].size() && ve[a[j]][lnk[j] + mx - 1] <= r && a[j] < ans) ans = a[j];
        }
        if (bel[l] != bel[r]) for (int j = (bel[r] - 1) * blo + 1; j <= r; j++) {
            while (lnk[j] - mx >= 0 && ve[a[j]][lnk[j] - mx] >= l) ++mx, ans = a[j];
            if (lnk[j] - mx >= -1 && ve[a[j]][lnk[j] - mx + 1] >= l && a[j] < ans) ans = a[j];
        }
        last = b[ans];
        write(b[ans]); enter;
    }
    return 0;
}

这可以跑到RANK1…