【BZOJ 3110】【ZJOI 2013】K大数查询

树状数组套线段树+二分答案 code：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
struct node{
	node *l,*r;
	int size,add;
	node(){l=r=NULL; size=add=0; }
};
node *tree[800000];
int node1[200000],delta[200000],n,m;
int lowbit(int x){return x&(-x); }
void updata(node *&i,int l,int r)
{
	i->size=0;
	if (i->l!=NULL) i->size+=i->l->size;
	if (i->r!=NULL) i->size+=i->r->size;
	i->size+=(r-l+1)*i->add;
}
void seg_ins(node *&i,int l,int r,int x,int y)
{
	int mid=(l+r)/2;
	if (!i) i=new(node);
	if (x<=l&&y>=r)
	  {
	    i->add++;
	    updata(i,l,r);
	    return;
	  }
	if (x<=mid) seg_ins(i->l,l,mid,x,y);
	if (y>mid) seg_ins(i->r,mid+1,r,x,y);
	updata(i,l,r);
}
void bit_ins(int a,int b,int x)
{
	for (;x<=n;x+=lowbit(x))
	  seg_ins(tree[x],1,n,a,b);
}
void num_ins(int i,int l,int r,int x,int y)
{
	int mid=(l+r)/2;
	if (x<=l&&y>=r)
	  {
	    node1[i]+=(r-l+1);
	    delta[i]++;
	    return;
	  }
	else
	  {
	if (x<=mid) num_ins(i<<1,l,mid,x,y);
	if (y>mid) num_ins(i<<1|1,mid+1,r,x,y);
	node1[i]=node1[i<<1]+node1[i<<1|1]+delta[i]*(r-l+1);
      }
}
int seg_ask(node *&i,int l,int r,int x,int y,int add)
{
	int mid=(l+r)/2;
	if(i==NULL) return add*(min(r,y)-max(l,x)+1);
	if (x<=l&&y>=r)
	  return i->size+add*(r-l+1);
	int left=0,right=0;
	if (x<=mid) left=seg_ask(i->l,l,mid,x,y,add+i->add);
	if (y>mid) right=seg_ask(i->r,mid+1,r,x,y,add+i->add);
	return left+right;
}
int bit_ask(int l,int r,int x)
{
	int ans=0;
	for (;x;x-=lowbit(x))
	  ans+=seg_ask(tree[x],1,n,l,r,0);
	return ans;
}
int num_ask(int i,int l,int r,int x,int y,int add)
{
	int mid=(l+r)/2;
	int left,right;
	if (x<=l&&y>=r)
	  return node1[i]+add*(r-l+1);
	left=0; right=0;
	if (x<=mid) left=num_ask(i<<1,l,mid,x,y,add+delta[i]);
	if (y>mid) right=num_ask(i<<1|1,mid+1,r,x,y,add+delta[i]);
	return left+right;
}
int main()
{
	int i,opt,a,b,c,sum,t,low,high,mid,ans;
	scanf("%d%d",&n,&m);
	for (i=1;i<=m;++i)
	  {
	    scanf("%d%d%d%d",&opt,&a,&b,&c);
	    if (opt==1)
	      {
	        bit_ins(a,b,c);
	        num_ins(1,1,n,a,b);
	       }
	    if (opt==2)
	      {
	        sum=num_ask(1,1,n,a,b,0);
			c=sum-c+1;
			low=1; high=n;
			while (low<high)
			  {
			  	mid=(low+high)/2;
			    ans=bit_ask(a,b,mid);
			    if (ans<c) low=mid+1;
				if (ans>=c) high=mid; 
			  }
			printf("%d\n",low);
	      }
	  }
}