【树状数组】 HDOJ 4638 Group

离线处理，单点插入。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 100005
#define maxm 40005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

int num[maxn], sum[maxn], res[maxn];
int done[maxn], val[maxn], pos[maxn];
struct node
{
	int id, a, b;
}op[maxn];
int n, m;

int cmp(node a, node b)
{
	return a.a < b.a;
}
void add(int x, int v)
{
	for(int i = x; i <= n; i += lowbit(i)) sum[i] += v;
}
int query(int x)
{
	int ans = 0;
	for(int i = x; i > 0; i -= lowbit(i)) ans += sum[i];
	return ans;
}
void init(void)
{
	memset(sum, 0, sizeof sum);
	memset(done, 0, sizeof done);
}
void read(void)
{
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++) scanf("%d", &num[i]), pos[num[i]] = i;
	for(int i = 1; i <= m; i++) scanf("%d%d", &op[i].a, &op[i].b), op[i].id = i;
}
void work(void)
{
	sort(op+1, op+m+1, cmp);
	for(int i = 1; i <= n; i++) {
		if(done[num[i]-1] && done[num[i]+1]) add(i, -1), val[i] = -1;
		else if(!done[num[i]-1] && !done[num[i]+1]) add(i, 1), val[i] = 1;
		else add(i, 0), val[i] = 0;
		done[num[i]] = 1;
	}
	for(int i = 1, j = 1; i <= m; i++) {
		while(j <= n && j < op[i].a) {
			add(j, -val[j]);
			if(num[j]+1 <= n && done[pos[num[j]+1]]) add(pos[num[j]+1], 1), val[pos[num[j]+1]]++;
			if(num[j]-1 > 0 && done[pos[num[j]-1]]) add(pos[num[j]-1], 1), val[pos[num[j]-1]]++;
			done[j++] = 0;
		}
		res[op[i].id] = query(op[i].b);
	}
	for(int i = 1; i <= m; i++) printf("%d\n", res[i]);
}
int main(void)
{
	int _;
	while(scanf("%d", &_)!=EOF) {
		while(_--) {
			read();
			init();
			work();
		}
	}
	return 0;
}