HDU - 4614 Vases and Flowers线段树+二分

什么是线段树+二分？

对着这题来说：二分左右端点——用线段树判断罢了

题解

#include<bits/stdc++.h>
using namespace std;
const int N = 5e4+15;
int sm[N<<2],lazy[N<<2];
int n,m;
void pushup(int k){sm[k]=sm[k<<1]+sm[k<<1|1];}
void pushdown(int k,int l,int r){
	if(~lazy[k]){
		int mid=l+r>>1;
		lazy[k<<1]=lazy[k<<1|1]=lazy[k];
		sm[k<<1]=(mid-l+1)*lazy[k];
		sm[k<<1|1]=(r-mid)*lazy[k];
		lazy[k]=-1;
	}
}
void build(int k,int l,int r){
	sm[k]=0,lazy[k]=-1;
	if(l==r)
		return;
	int mid=l+r>>1;
	build(k<<1,l,mid);
	build(k<<1|1,mid+1,r);
	pushup(k);
}
void update(int k,int l,int r,int x,int y,int del){
	if(x<=l&&r<=y){
		sm[k]=(r-l+1)*del;
		lazy[k]=del;
		return;
	}
	pushdown(k,l,r);
	int mid=l+r>>1;
	if(x<=mid)
		update(k<<1,l,mid,x,y,del);
	if(y>mid)
		update(k<<1|1,mid+1,r,x,y,del);
	pushup(k);
}
int query(int k,int l,int r,int x,int y){
	if(x<=l&&r<=y){
		return sm[k];
	}
	pushdown(k,l,r);
	int mid=l+r>>1;
	int ans=0;
	if(x<=mid)
		ans+=query(k<<1,l,mid,x,y);
	if(y>mid)
		ans+=query(k<<1|1,mid+1,r,x,y);
	return ans;
}
void slv(int b,int c){
	int l=b,r=n,mid;
	while(l<r){
		mid=l+r>>1;
		//cout<<mid<<" +++"<<query(1,1,n,l,mid)<<endl;
		if(mid-l+1>query(1,1,n,l,mid))
			r=mid;
		else
			l=mid+1;
	}
	//cout<<l<<endl;
	if(query(1,1,n,l,l)){
		cout<<"Can not put any one.\n";return;
	}
	int lef=l;
	r=n;
	while(l<r){
		mid=l+r>>1;
		if(mid-b+1-query(1,1,n,b,mid)<c&&query(1,1,n,mid+1,n)<n-mid)
			l=mid+1;
		else
			r=mid;
	}
	cout<<lef-1<<" "<<r-1<<'\n';
	update(1,1,n,lef,r,1);
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	int t;cin>>t;
	while(t--){
		cin>>n>>m;
		build(1,1,n);
		for(int i=0;i<m;i++){
			int a,b,c;cin>>a>>b>>c;
			if(a==1){
				b++;
				slv(b,c);
			}else{
				b++,c++;
				cout<<query(1,1,n,b,c)<<'\n';
				update(1,1,n,b,c,0);
			}
		}
		cout<<endl;
	}
}