就是把所有与当前预约冲突的预约删除
不断取某位置前面第一个比自己小的端点,用树状数组+二分维护
每个区间最多进队一次、出队一次 复杂度 O(nlog2n) O ( n log 2 n )
#include<bits/stdc++.h>
#define il inline
#define max(a,b) ((a)>(b))?(a):(b)
#define min(a,b) ((a)<(b))?(a):(b)
using namespace std;
#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
il int read(){
int x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=(x+(x<<2)<<1)+c-48;
return x*f;
}
il bool cread(){
char c=getchar();
for(;!isalpha(c);c=getchar());
return c=='A';
}
char sr[1<<21],z[20];int C=-1,Z;
il void Ot(){fwrite(sr,1,C+1,stdout),C=-1;}
il void print(int x){
if(C>1<<20)Ot();if(x<0)sr[++C]=45,x=-x;
while(z[++Z]=x%10+48,x/=10);
while(sr[++C]=z[Z],--Z);sr[++C]='\n';
}
const int N=100005;
int t[N],a[N];
int n,m,ans,c,s,e,l,r;
il int lowbit(int k){return k&-k;}
il void add(int x,int y){while(x<=N) t[x]+=y,x+=lowbit(x);}
il int ask(int x){
int sum=0;
while(x) sum+=t[x],x-=lowbit(x);
return sum;
}
int main(){
n=read();
for(int i=1;i<=n;++i){
if(cread()){
c=0,s=read(),e=read();
for(int j;j=ask(e);){
l=0,r=e;
while(l<r) m=l+r>>1,(ask(m)+1<=j)?l=m+1:r=m;
if(a[l]>=s) add(l,-1),++c,--ans;
else break;
}
add(s,1),a[s]=e,++ans,print(c);
}else print(ans);
}Ot();return 0;
}