感觉比较抽象:举个例子:a[] = {3 1 2 5 4}
树状数组里面:1,1,-1,1,-1
sum(2):就是[1,2]区间能分成多少个连续的段:1和3
sum(3):1 2 3是一段
如果是询问[2,4],那么我们要把位置1上的3删掉,其实删是加的逆过程,因为3加入的时候2和4还在3的后面所以就
a
d
d
(
i
,
1
)
add(i,1)
add(i,1),那么这样我们删掉就是
a
d
d
(
i
,
−
1
)
add(i,-1)
add(i,−1)现在段数是增加的我们应该在后面哪里加呢?
a
d
d
(
p
o
s
[
a
[
i
]
+
1
]
,
1
)
,
a
d
d
(
p
o
s
[
a
[
i
]
−
1
]
,
1
)
add(pos[a[i]+1],1),add(pos[a[i]-1],1)
add(pos[a[i]+1],1),add(pos[a[i]−1],1),因为对于pos[a[i]-1]之前的位置来说你是删了a[i]是最后一个数段数不会增加所以+1去抵消-1,对于a[i]+1来说你删了前面的一个数它自己独立出来了,对于a[i]+1来说,因为a[i]在a[i]+1前面之前那么a[i]+1 的贡献是0,现在a[i]删了,那么它的贡献就变成1了
删完3之后树状数组:
0,1,0,1,0
同理其他位置也可以推出来
#include <iostream>
#include <cstdio>
#include <stack>
#include <sstream>
#include <vector>
#include <map>
#include <cstring>
#include <deque>
#include <cmath>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#define mid ((l + r) >> 1)
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define _for(i,a,b) for( int i = (a); i < (b); ++i)
#define _rep(i,a,b) for( int i = (a); i <= (b); ++i)
#define for_(i,a,b) for( int i = (a); i >= (b); -- i)
#define rep_(i,a,b) for( int i = (a); i > (b); -- i)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define hash Hash
#define next Next
#define count Count
#define pb push_back
#define f first
#define s second
using namespace std;
const int M = 1e5+10, mod = 1e9 + 7;
const double eps = 1e-10;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
template<typename T> void read(T &x)
{
x = 0;char ch = getchar();ll f = 1;
while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args)
{
read(first);
read(args...);
}
int T;
int n, m;
int pos[M], ans[M];
int tr[M], a[M];
inline void add(int x, int val)
{
while(x <= n)
{
tr[x] += val;
x += lowbit(x);
}
return;
}
inline int sum(int x)
{
int res = 0;
while(x)
{
res += tr[x];
x -= lowbit(x);
}
return res;
}
struct node
{
int l, r, id;
bool operator < (const node & w) {
return l < w.l;
}
}e[M];
int main()
{
read(T);
while(T --)
{
memset(tr,0,sizeof(tr));
read(n,m);
for(int i = 1; i <= n; ++ i) read(a[i]), pos[a[i]] = i;
int l, r;
for(int i = 0; i < m; ++ i)
{
read(l,r);
e[i] = {l,r,i};
}
sort(e,e+m);
pos[0] = n + 1, pos[n + 1] = n + 1;
for(int i = 1; i <= n; ++ i)
{
if(i > pos[a[i] - 1] && i > pos[a[i] + 1]) add(i,-1);
else if(i < pos[a[i] - 1] && i < pos[a[i] + 1]) add(i,1);
}
int j = 0, i = 1;
while(j < m)
{
while(i <= n && i < e[j].l)
{
if(i < pos[a[i] - 1] && i < pos[a[i] + 1])
{
add(i,-1);
add(pos[a[i] - 1],1);
add(pos[a[i] + 1],1);
}
else if(i > pos[a[i] - 1] && i > pos[a[i] + 1]) add(i,-1);
else if(i < pos[a[i] - 1])
{
add(i,-1);
add(pos[a[i] - 1],1);
}
else
{
add(i,-1);
add(pos[a[i] + 1],1);
}
i ++;
}
while(e[j].l == i && j < m)
ans[e[j].id] = sum(e[j].r), j ++;
}
for(int i = 0; i < m; ++ i)
cout << ans[i] << endl;
}
return 0;
}