题目链接:https://ajax.loj.ac/problem/6284
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
int a[maxn], pos[maxn], blo, n, tag[maxn], l, r, c;
void reset(int x)
{
if(tag[x]== -1) return;
for (int i = (x-1)*blo+1; i<= x*blo; i++)
{
a[i] = tag[x];
}
tag[x] = -1;
}
int solve(int l, int r, int c)
{
int ans = 0;
reset(pos[l]);
for (int i = l; i <= min(pos[l]*blo, r); i++){
if(a[i] != c) a[i] = c;
else ans++;
}
if(pos[l] != pos[r])
{
reset(pos[r]);
for (int i = (pos[r]-1)*blo+1; i <= r; i++)
{
if(a[i] != c) a[i] = c;
else ans++;
}
}
for (int i = pos[l]+1; i <&