[ZJOI 2013]K大数查询

洛谷

比较板的整体二分，直接上代码。

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 50005
#define lowbit(x) x & (-x)
#define MAXQ MAXN + (MAXN << 2)
#define LL long long
#define Int register int
using namespace std;
inline void read(LL &x)
{
	x = 0;
	LL f = 1;
	char s = getchar();
	while (s < '0' || s > '9')
	{
		if (s == '-')
			f = -1;
		s = getchar();
	}
	while (s >= '0' && s <= '9')
	{
		x = (x << 3) + (x << 1) + (s ^ 48);
		s = getchar();
	}
	x *= f;
}
inline LL Max(LL x,LL y)
{
	if (x > y)
		return x;
	return y;
}
struct node
{
	LL Type, l, r, k, Index;
	node(){}
	node(LL TYPE,LL L,LL R,LL K,LL INDEX)
	{
		Type = TYPE;
		l = L;
		r = R;
		k = K;
		Index = INDEX;
	}
}Ask[MAXN], Zt[MAXN], Yt[MAXN];
bool SC[MAXN];
LL n, m, Ans[MAXN];
LL C1[MAXN], C2[MAXN];
inline void Add(LL x,LL Val)
{
	for (Int i = x; i <= n; i += lowbit( i ))
		C1[i] += Val, C2[i] += x * Val;
}
inline LL Query(LL x)
{
	LL Res = 0;
	for (Int i = x; i; i -= lowbit( i ))
		Res += C1[i] * (x + 1) - C2[i];
	return Res;
}
inline void ZTEF(LL Ql,LL Qr,LL l,LL r)
// [Ql,Qr]: 当前操作区间
// [l,r]: 二分值区域 
{
	if (Ql > Qr)
		return ;
	if (l == r)
	{
		for (Int i = Ql; i <= Qr; ++ i)
			Ans[Ask[i].Index] = l;
		return ;
	}
	LL Mid = (l + r) / 2; // 第 k 大值的大小
	LL tl = 0, tr = 0;
	for (Int i = Ql; i <= Qr; ++ i) // 当前操作区间 
	{
		if (Ask[i].Type == 1) // 修改，每个数集里加入一个数 
		{
			if (Ask[i].k > Mid) // 要放入右区间 
			{
				Add(Ask[i].l, 1);
				Add(Ask[i].r + 1, -1);
				// [l,r] ++
				Yt[++ tr] = Ask[i]; 
			}
			else Zt[++ tl] = Ask[i];
		}
		else // 查询 
		{
			LL Qu = Query( Ask[i].r ) - Query( Ask[i].l - 1);
			if (Qu >= Ask[i].k)
				Yt[++ tr] = Ask[i];
			else Ask[i].k -= Qu, Zt[++ tl] = Ask[i];
		}
	}
	for (Int i = Ql; i <= Qr; ++ i)
	{
		if (Ask[i].Type == 1) // 修改回退
			if (Ask[i].k > Mid)
			{
				Add(Ask[i].l, -1);
				Add(Ask[i].r + 1, 1);
			}
	}
	for (Int i = 1; i <= tl; ++ i)
		Ask[Ql + i - 1] = Zt[i];
	for (Int i = 1; i <= tr; ++ i)
		Ask[Ql + tl + i - 1] = Yt[i];
	ZTEF(Ql, Ql + tl - 1, l, Mid);
	ZTEF(Ql + tl, Qr, Mid + 1, r);
}
int main()
{
	read( n ); read( m );
	for (Int i = 1; i <= m; ++ i)
	{
		LL Ty, l, r, c;
		read( Ty ); read( l ); read( r ); read( c );
		Ask[i] = node(Ty, l, r, c, i);
		if (Ty == 2)
			SC[i] = 1;
	}
	ZTEF(1, m, 1, n);
	for (Int i = 1; i <= m; ++ i)
		if ( SC[i] )
			printf("%lld\n", Ans[i]);
	return 0;
}