牛客练习赛10 E.数列查找 区间出现次数第k1小的数中值第k2小的数

题目链接

一看数据，大概率是莫队。往莫队方向想了之后，发现我们需要在短时间内找出出现次数第k1小的数并且还要找到

值第k2小，看了题解才知道分块即可。

///                 .-~~~~~~~~~-._       _.-~~~~~~~~~-.
///             __.'              ~.   .~              `.__
///           .'//                  \./                  \\`.
///        .'//                     |                     \\`.
///       .'// .-~"""""""~~~~-._     |     _,-~~~~"""""""~-. \\`.
///     .'//.-"                 `-.  |  .-'                 "-.\\`.
///   .'//______.============-..   \ | /   ..-============.______\\`.
/// .'______________________________\|/______________________________`.
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/STACK:102400000,102400000")
//#pragma GCC target(sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx) 
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <fstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define pf printf
typedef long long LL;
typedef pair <int, int> ii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e5+100;
const int maxx=1e7+10;
const double EPS=1e-8;
const double eps=1e-8;
const LL mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

struct X {
	int l,r,k1,k2,id;
}q[maxn];
int n,m;
int pos[maxn],real[maxn];//real 是否处理过 
int a[maxn];
int sz;
int num[maxn],blo[maxn][205];//num a[i]出现次数  blo[i][j] 出现i次在第j块数的个数 
int bcot[205],cot[maxn];//bcot 在该块的个数  cot 在该次数下的总数 
int ans[maxn];
bool cmp(X a,X b) {
	return pos[a.l]<pos[b.l]||pos[a.l]==pos[b.l]&&a.r<b.r;
}

int qcot(int need) {
	int sum=0;
	for(int i=0;i<=sz+1;i++) {
		sum+=bcot[i];
		if(sum>=q[need].k1) {
			sum-=bcot[i];
			for(int j=i*sz;j<(i+1)*sz;j++){
				sum+=cot[j];
				if(sum>=q[need].k1) 
					return j;
			}
		}
	}
	return 0;
}
int qnum(int cot,int need) {
	int sum=0;
	for(int i=0;i<=sz+1;i++) {
		sum+=blo[cot][i];
		if(sum>=q[need].k2) {
			sum-=blo[cot][i];
			for(int j=i*sz;j<(i+1)*sz;j++) {
				if(num[j]==cot) sum++;
				if(sum>=q[need].k2) 
					return j;
			}
		}
	}
	return 0;
}
void change(int x,int w) {
	if(w) {
		if(num[x]!=0) {
			blo[num[x]][x/sz]--;
			if(real[num[x]]==1) bcot[num[x]/sz]--,cot[num[x]]--;
			real[num[x]]--;
		}
		blo[++num[x]][x/sz]++;
		if(real[num[x]]==0) bcot[num[x]/sz]++,cot[num[x]]++;
		real[num[x]]++;
	}
	else {
		blo[num[x]][x/sz]--;
		if(real[num[x]]==1) bcot[num[x]/sz]--,cot[num[x]]--;
		real[num[x]]--;
		if(num[x]!=1) {
			blo[--num[x]][x/sz]++;
			if(real[num[x]]==0) bcot[num[x]/sz]++,cot[num[x]]++;
			real[num[x]]++;
		}
		else num[x]--;
	}
}


void solve() {
	s_1(n);
	sz=sqrt(n);
	FOR(1,n,i) s_1(a[i]);
	FOR(1,n,i) pos[i]=(i-1)/sz+1;
	s_1(m);
	FOR(1,m,i) {
		int l,r,k1,k2;
		s_3(l,r,k1);
		s_1(k2);
		q[i]=X{l,r,k1,k2,i};
	}
	sort(q+1,q+m+1,cmp);
	int l=1,r=0;
	FOR(1,m,i) {
		W(r<q[i].r) r++,change(a[r],1);
        W(r>q[i].r) change(a[r],0),r--;
        W(l<q[i].l) change(a[l],0),l++;
        W(l>q[i].l) l--,change(a[l],1);
        int now=qcot(i);
        now=qnum(now,i);
        ans[q[i].id]=now;
    }
    FOR(1,m,i) 
    	print(ans[i]);
}
int main() {
	//freopen( "1.in" , "r" , stdin );
    //freopen( "1.out" , "w" , stdout );
    int t=1;
    //init();
    //s_1(t);
    for(int cas=1;cas<=t;cas++) {
        //printf("Case #%d: ",cas);
        solve();
    }
}