这个题目以前做过,当时是用分块和划分树主席树过的,今天学习了整体二分来练习一下。
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
using namespace std;
#define LL long long
#define sca(x) scanf("%d",&x)
#define lowb(x) (x&(-x))
#define pb(x) push_back(x)
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define pri(x) printf("%d\n",x);
#define N 300005
#define inf 0x3f3f3f3f
const LL mod=1e9+7;
int tot;
struct node
{
int x,y,k,id,t;
}q[N],q1[N],q2[N];
int ou[N];
struct BIT
{
int c[N];
int maxn;
void init(int n)
{
memset(c,0,sizeof(c));
maxn=n;
}
void add(int x,int val)
{
for(int i=x;i<=maxn;i+=lowb(i))c[i]+=val;
}
int ask(int x)
{
int ans=0;
for(int i=x;i;i-=lowb(i))ans+=c[i];
return ans;
}
}bit;
void solve(int ql,int qr,int l,int r)
{
//cout<<ql<<" "<<qr<<" "<<l<<" "<<r<<endl;
if(ql>qr) return ;
if(l==r)
{
for(int i=ql;i<=qr;i++)
{
if(q[i].t==2)ou[q[i].id]=l;
}
return ;
}
int m=(l+r)>>1;
int L=0,R=0;
for(int i=ql;i<=qr;i++)
{
//cout<<"i="<<i<<endl;
if(q[i].t==1)
{
if(q[i].x<=m)
{
bit.add(q[i].id,q[i].y);
q1[L++]=q[i];
}
else q2[R++]=q[i];
}
else
{
int res=bit.ask(q[i].y)-bit.ask(q[i].x-1);
if(res>=q[i].k)q1[L++]=q[i];
else
{
q[i].k-=res;
q2[R++]=q[i];
}
}
}
int now=ql;
rep(i,0,L-1)if(q1[i].t==1)bit.add(q1[i].id,-1);
rep(i,0,L-1)q[now++]=q1[i];
rep(i,0,R-1)q[now++]=q2[i];
solve(ql,ql+L-1,l,m);
solve(ql+L,ql+L+R-1,m+1,r);
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
tot=1;
bit.init(n);
rep(i,1,n)
{
int tmp;
sca(tmp);
q[tot++]=node{tmp,1,inf,i,1};
}
rep(i,1,m)
{
int x,y,k;
scanf("%d%d%d",&x,&y,&k);
q[tot++]=node{x,y,k,i,2};
}
solve(1,tot-1,-inf,inf);
rep(i,1,m)pri(ou[i]);
}
}