参考样例,第一行输入n,m ,n代表有n个房间,编号为1—n,开始都为空房,m表示以下有m行操作,以下 每行先输入一个数 i
,表示一种操作:若i为1,表示查询房间,再输入一个数x,表示在1–n
房间中找到长度为x的连续空房,输出连续x个房间中左端的房间号,尽量让这个房间号最小,若找不到长度为x的连续空房,输出0。若找得到,在这x个空房间中住上人。若i为2,表示退房,再输入两个数 x,y 代表 房间号 x—x+y-1 退房,即让房间为空。
线段树区间和并。
#include<bits/stdc++.h>
using namespace std;
// clock_t start, end;
// start = clock();
// end = clock();
// cout << (double) (end - start) / CLOCKS_PER_SEC << endl;
//#define int long long
#define rep(i, x, y) for(auto i=(x);i<=(y);++i)
#define dep(i, x, y) for(auto i=(x);i>=(y);--i)
#define gcd(a, b) __gcd(a,b)
const long long mod = 1e9 + 7;
const int maxn = 4e6 + 100;
int lowbit(int x) { return x & -x; }
bool ispow(int n) { return (n & (n - 1)) == 0; }//O(1) 判断是否是 2^k(2的k次方)
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * f;
}
int n, m;
int t[maxn], a[maxn];
int ls[maxn], rs[maxn], M[maxn], len[maxn];
int lazy[maxn];
void pushup(int k) {
if (ls[k << 1] == len[k << 1])
ls[k] = ls[k << 1] + ls[k << 1 | 1];
else ls[k] = ls[k << 1];
if (rs[k << 1 | 1] == len[k << 1 | 1])
rs[k] = rs[k << 1 | 1] + rs[k << 1];
else rs[k] = rs[k << 1 | 1];
len[k] = len[k << 1] + len[k << 1 | 1];
M[k] = max(rs[k << 1] + ls[k << 1 | 1], M[k << 1]);
M[k] = max(M[k], M[k << 1 | 1]);
}
void build(int k, int l, int r) {
if (l == r) {
ls[k] = rs[k] = 1;
M[k] = len[k] = 1;
return;
}
int mid = (l + r) >> 1;
build(k << 1, l, mid);
build(k << 1 | 1, mid + 1, r);
pushup(k);
}
//区间修改
void pushdown(int k) {
if (lazy[k] == 1) {
M[k << 1] = M[k << 1 | 1] = 0;
rs[k << 1] = rs[k << 1 | 1] = ls[k << 1] = ls[k << 1 | 1] = 0;
lazy[k << 1] = lazy[k << 1 | 1] = 1;
}
if (lazy[k] == 2) {
M[k << 1] =ls[k<<1]=rs[k<<1]= len[k<<1];
M[k<<1|1]=ls[k<<1|1]=rs[k<<1|1]=len[k<<1|1];
lazy[k << 1] = lazy[k << 1 | 1] = 2;
}
lazy[k] = 0;
}
int tag;
void update(int k, int l, int r, int L, int R) {
//懒标下放
pushdown(k);
if (l >= L && r <= R) {
if(tag==1) {
M[k] = 0, ls[k] = 0, rs[k] = 0;
lazy[k] = 1;
}
else {
M[k]=rs[k]=ls[k] = len[k];
lazy[k]=2;
}
return;
}
int mid = (l + r) >> 1;
if (L <= mid)
update(k<<1, l, mid, L, R);
if (R > mid)
update(k<<1|1, mid + 1, r, L, R);
pushup(k);
}
int quer(int k,int l,int r,int x){
pushdown(k);
int mid=(l+r)>>1;
if(M[k<<1]>=x)
quer(k<<1,l,mid,x);
else if (rs[k << 1] + ls[k << 1 | 1] >= x){
return mid-rs[k<<1]+1;
}
else {
quer(k<<1|1,mid+1,r,x);
}
}
int main() {
cin >> n >> m;
build(1,1,n);
for(int i=1;i<=m;i++){
int q;
cin>>q;
if(q==1){
int x;
cin>>x;
if(M[1]<x){
cout<<0<<endl;
continue;
}
int ans=quer(1,1,n,x);
cout<<ans<<endl;
tag=1;
update(1,1,n,ans,ans+x-1);
}
else {
int x,y;
cin>>x>>y;
tag=2;
update(1, 1, n, x, x+y-1);
}
}
return 0;
}