题意:
有1-n个村子,3种操作,D- x表示摧毁x村,R表示修好刚被摧毁的村子,Q-x,表示询问你x所在的村子附近连着一共有多少村子是没有摧毁的。
思路:
用树状数组记录被摧毁的村子的和,p[x],表示1-x共有多少村子被摧毁,
然后我们可以用二分查找进行解答,当你询问x村时,如果x村已经被摧毁,那就输出0,否则先找出1-x村有多少被摧毁,假设n个被摧毁,这个时候我们就可以用
二分查找,找出x最小为多少时有n个村子被摧毁,x最大为多少时有多少村子被摧毁,答案就是
差值
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int maxn = 50000+5;
using namespace std;
int n,m;
int C[maxn];
int V[maxn], cur;
char op[5];
bool vis[maxn];
int lowbit(int x){ return x & -x; }
void add(int x, int v){ for(int i = x; i <= n; i+= lowbit(i)) C[i]+= v; }
int sum(int x){
int s = 0;
for(int i = x; i > 0; i-= lowbit(i)) s+= C[i];
return s;
}
int BS(int v){
int L = 0, R = n+1;
while(L < R){
int mid = (L+R)/2;
int t = sum(mid);
if(t >= v) R = mid;
else L = mid + 1;
}
return L;
}
int main()
{
freopen("in.txt","r",stdin);
int x;
while(scanf("%d%d",&n,&m) == 2){
memset(C, 0, sizeof(C));
memset(vis, 0, sizeof(vis));
cur = 0;
for(int i = 0; i < m; ++i){
scanf("%s",op);
//printf("%s %d\n", op, x);
if(op[0] == 'R'){ x = V[--cur]; vis[x] = 0; add(x, -1); }
else if(op[0] == 'D'){ scanf("%d",&x); V[cur++] = x; vis[x] = 1; add(x, 1); }
else if(op[0] == 'Q'){
scanf("%d",&x);
if(vis[x]){printf("0\n"); continue;}
int v = sum(x);
int leftmost = BS(v);
int rightmost = BS(v+1);
printf("%d\n", rightmost - leftmost - 1);
}
}
}
fclose(stdin);
return 0;
}