BZOJ2906 颜色

每n^2/3个数分一块，然后预处理从第i块到第j块前k个数的答案以及第k个数有多少个

然后查询的时候同块暴力，不同块的话中间调用答案，两边零散的调用已经有多少个数来更新答案

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<stack>
using namespace std;
#define MAXN 50010
#define MAXM 20010
#define MAXS 40
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
#define ll long long
int n,m,q;
int a[MAXN];
int c[MAXS][MAXS][MAXM];
int C[MAXN],vis[MAXN];
int T;
ll ans[MAXS][MAXS][MAXM];
int bel[MAXN];
int siz;
int st[MAXN],ed[MAXN];
ll la;
ll ask(int l,int r,int x,int y){
	int i;
	ll re=0;
	T&#