题目:
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2112
题意:
给出一个长度为n的整数数组,有以下两种操作: Q i j k意为求区间[i,j]内的第k小数,C i t意为把第i个数换成t
思路:
这道题有很多做法,主席树,平衡树,整体二分等等,这里用了分块,虽然效率比较挫,但是简单好写容易理解,高级数据结构经常忘。。。
#include <bits/stdc++.h>
using namespace std;
const int N = 50000 + 10, INF = 0x3f3f3f3f;
int n, m;
int block, sz;//块大小和块数量
int pos[N], L[N], R[N];//pos数组记录每个元素所在的块,L和R数组记录每个块管辖的区间
int a[N], b[N];//a是原始数组,b表示块内有序的元素
void reset(int x)
{
for(int i = L[x]; i <= R[x]; i++) b[i] = a[i];
sort(b + L[x], b + R[x] + 1);
}
void init()
{
block = sqrt(n);
sz = n / block;
if(n % block) sz++;
for(int i = 1; i <= n; i++) pos[i] = (i-1) / block + 1;
for(int i = 1; i <= sz; i++)
{
L[i] = (i-1) * block + 1;
R[i] = i * block;
}
R[sz] = n;//最后一个块的右区间是n
for(int i = 1; i <= sz; i++) reset(i);//块内排序
}
void update(int x, int v)
{
a[x] = v;
reset(pos[x]);
}
int query(int l, int r, int v)
{
int lb = pos[l], rb = pos[r];
int ans = 0;
if(lb == rb)
{
for(int i = l; i <= r; i++)
if(a[i] <= v) ans++;
}
else
{
for(int i = l; i <= R[lb]; i++)
if(a[i] <= v) ans++;
for(int i = L[rb]; i <= r; i++)
if(a[i] <= v) ans++;
for(int i = lb + 1; i < rb; i++)
ans += upper_bound(b + L[i], b + R[i] + 1, v) - (b + L[i]);
}
return ans;
}
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
init();
scanf("%d", &m);
char ch;
int x, y, z;
for(int i = 1; i <= m; i++)
{
scanf(" %c", &ch);
if(ch == 'Q')
{
scanf("%d%d%d", &x, &y, &z);
int l = 1, r = 1e9, res;
while(l <= r)
{
int mid = (l + r) >> 1;
if(query(x, y, mid) >= z) r = mid - 1, res = mid;
else l = mid + 1;
}
printf("%d\n", res);
}
else
{
scanf("%d%d", &x, &y);
update(x, y);
}
}
}
return 0;
}