题意:
给n个数,q次询问,每次询问给出一个区间[l,r],要你求出最大的h,使得在[l,r]这个区间内满足,至少有h个数的值大于等于h。
思路:
主席树可以求区间[l, r]的第k小,这里改造一下,求区间[l, r]中比val小的数有多少个。
设区间内>=h的个数为w,题意是要w >= h。所以二分h,h的范围是[1, r-l+1],每次求出>=h的数有多少个,比较,继续二分。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long LL;
const int maxn = 100000+5;
int n,q;
int lson[maxn<<5], rson[maxn<<5], Tree[maxn<<5], root[maxn];
int cnt;
void Build(int l, int r, int& rt){
rt = ++cnt; Tree[rt] = 0;
if(l == r) return;
int mid = (l+r) >> 1;
Build(l, mid, lson[rt]);
Build(mid+1, r, rson[rt]);
}
void update(int& new_rt, int old_rt, int l, int r, int pos){
new_rt = ++cnt;
lson[new_rt] = lson[old_rt]; rson[new_rt] = rson[old_rt];
Tree[new_rt] = Tree[old_rt] + 1;
if(l == r) return;
int mid = (l+r) >> 1;
if(pos <= mid) update(lson[new_rt], lson[old_rt], l, mid, pos);
else update(rson[new_rt], rson[old_rt], mid+1, r, pos);
}
int Query(int la, int rb, int l, int r, int k){
if(l == r) return Tree[rb] - Tree[la];
int mid = (l+r) >> 1;
if(k <= mid) return Query(lson[la], lson[rb], l, mid, k);
else return Tree[lson[rb]] - Tree[lson[la]] + Query(rson[la], rson[rb], mid+1, r, k);
}
int solve(int L, int R){
int l = 1, r = R-L+1;
while(l <= r){
int mid = (l+r) >> 1;
int w = Query(root[L-1], root[R], 1, n, mid-1);// [l, R]区间中比严格 < mid的有多少个
//printf("mid = %d, w = %d\n", mid,w);
w = R-L+1-w; // [l, R]区间中比 >= mid的有多少个
if(w < mid) r = mid - 1;
else l = mid + 1;
}
return r;
}
int main()
{
int x, y;
while(scanf("%d%d",&n,&q) == 2){
cnt = 0;
Build(1, n, root[0]);
for(int i = 1; i <= n; ++i){
scanf("%d", &x);
update(root[i], root[i-1], 1, n, x);
//for(int i = 1; i <= 20; ++i) printf("%d ", Tree[i]);puts("");
}
for(int i = 1; i <= q; ++i){
scanf("%d%d", &x,&y);
printf("%d\n", solve(x,y));
}
}
fclose(stdin);
return 0;
}