Pagini recente » Cod sursa (job #884418) | Cod sursa (job #1334939) | Cod sursa (job #1778181) | Cod sursa (job #1335502) | Cod sursa (job #2124257)
#include <fstream>
using namespace std;
ifstream cin ("hotel.in");
ofstream cout ("hotel.out");
int n,m;
int lt[500001],rt[500001],arb[500001],stg,rgt,c;
void init ()
{
lt[1]=rt[1]=arb[1]=n;
}
void up_date (int st,int dr,int nod)
{
if(stg<=st && dr<=rgt)
{
if(c==1) lt[nod]=rt[nod]=arb[nod]=0;
else lt[nod]=rt[nod]=arb[nod]=dr-st+1;
}
else
{
int mij=(st+dr)/2;
if(arb[nod]==0) lt[nod*2]=rt[nod*2]=lt[nod*2+1]=rt[nod*2+1]=arb[nod*2]=arb[nod*2+1]=0;
if(arb[nod]==dr-st+1) lt[nod*2]=rt[nod*2]=arb[nod*2]=mij-st+1,lt[nod*2+1]=rt[nod*2+1]=arb[nod*2+1]=dr-mij;
if(stg<=mij) up_date(st,mij,nod*2);
if(rgt>mij) up_date(mij+1,dr,nod*2+1);
lt[nod]=lt[nod*2]; if(lt[nod*2]==mij-st+1) lt[nod]+=lt[nod*2+1];
rt[nod]=rt[nod*2+1]; if(rt[nod*2+1]==dr-mij) rt[nod]+=rt[nod*2];
arb[nod]=max(arb[nod*2],arb[nod*2+1]);
arb[nod]=max(arb[nod],rt[nod*2]+lt[nod*2+1]);
}
}
void read ()
{
cin>>n>>m;
init();
for(int i=1;i<=m;i++)
{
cin>>c;
if(c==3) cout<<arb[1]<<"\n";
else
{
cin>>stg>>rgt; rgt=stg+rgt-1;
up_date(1,n,1);
}
}
}
int main()
{
read();
cin.close();
cout.close();
return 0;
}