这题其实和P6492 [COCI2010-2011#6] STEP思路差不多,
要维护的东西也差不多。
都是考虑区间合并的时候,需要哪些信息,然后和答案一起维护就好。
不过区间查询的时候需要注意,优先考虑左子区间的答案 ,然后是中间,最后是右子区间。
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 5e5+7;
const ll inf = 34359738370;
struct node
{
int ans;//最大的连续空房数目
int pans,sans;//前缀最大连续空房 后缀最大连续空房
}tree[maxn<<2];
int tag[maxn<<2];
int n,m;
inline int lc(int rt)
{
return rt<<1;
}
inline int rc(int rt)
{
return rt<<1|1;
}
inline void pushup(int rt,int l,int r)
{
int mid=(l+r)>>1;
int m=tree[lc(rt)].sans+tree[rc(rt)].pans;
tree[rt].ans=max(max(tree[lc(rt)].ans,tree[rc(rt)].ans),m);
//维护pans
if(tree[lc(rt)].pans != mid-l+1)
{
tree[rt].pans=tree[lc(rt)].pans;
}
else
{
tree[rt].pans=mid-l+1+tree[rc(rt)].pans;
}
//维护sans
if(tree[rc(rt)].sans != r-mid)
{
tree[rt].sans=tree[rc(rt)].sans;
}
else
{
tree[rt].sans=r-mid+tree[lc(rt)].sans;
}
return ;
}
inline void build(int rt,int l,int r)
{
if(l == r)
{
tree[rt].ans=tree[rt].pans=tree[rt].sans=1;
return ;
}
int mid=(l+r)>>1;
build(lc(rt),l,mid);
build(rc(rt),mid+1,r);
pushup(rt,l,r);
return ;
}
inline void pushdown(int rt,int l,int r)
{
if(!tag[rt]) return ;
int mid=(l+r)>>1;
if(tag[rt]==1)
{
tree[lc(rt)].ans=tree[lc(rt)].pans=tree[lc(rt)].sans=0;
tag[lc(rt)]=1;
tree[rc(rt)].ans=tree[rc(rt)].pans=tree[rc(rt)].sans=0;
tag[rc(rt)]=1;
}
else
{
tree[lc(rt)].ans=tree[lc(rt)].pans=tree[lc(rt)].sans=mid-l+1;
tag[lc(rt)]=2;//全空为2
tree[rc(rt)].ans=tree[rc(rt)].pans=tree[rc(rt)].sans=r-mid;
tag[rc(rt)]=2;
}
tag[rt]=0;
return ;
}
inline void updata(int rt,int l,int r,int vl,int vr,int v)//[vl,vr]区间全变成v
{
if(r<vl || l>vr) return ;
if(vl<=l && r<=vr)
{
if(v)//全住满
{
tree[rt].ans=tree[rt].pans=tree[rt].sans=0;
tag[rt]=1;
}
else //全空
{
tree[rt].ans=tree[rt].pans=tree[rt].sans=r-l+1;
tag[rt]=2;//全空为2
}
return ;
}
int mid=(l+r)>>1;
pushdown(rt,l,r);
updata(lc(rt),l,mid,vl,vr,v);
updata(rc(rt),mid+1,r,vl,vr,v);
pushup(rt,l,r);
return ;
}
inline int query(int rt,int l,int r,int x)
{
pushdown(rt,l,r);//先pushdown
if(l == r) return l;//只查1个房间的情况
int mid=(l+r)>>1;
if(tree[lc(rt)].ans>=x) return query(lc(rt),l,mid,x);
if(tree[lc(rt)].sans+tree[rc(rt)].pans >= x) return mid+1-tree[lc(rt)].sans;
return query(rc(rt),mid+1,r,x);
}
int main()
{
scanf("%d %d",&n,&m);
build(1,1,n);
int f,x,y;
while(m--)
{
scanf("%d",&f);
if(f == 1)
{
scanf("%d",&x);
if(tree[1].ans<x) printf("0\n");
else
{
int ans=query(1,1,n,x);
printf("%d\n",ans);
updata(1,1,n,ans,ans+x-1,1);
}
}
else
{
scanf("%d %d",&x,&y);
updata(1,1,n,x,x+y-1,0);
}
}
}