目前 Hack 是能够 AC 的。

#include <bits/stdc++.h>
#define ll long long
using namespace std;

long long read() {
	long long ans = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-') f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		ans = ans * 10 + (ch - '0');
		ch = getchar();
	}
	return ans * f;
}

const int N = 510000;
int n, q;
struct node {
	int a, b;
} a[N];
vector <pair <int, int> > as[N];

int lowbit(int x) {
	return x & (-x);
}

struct bitt {
	int sum[N];
	void add(int x, int k) {
		while (x <= n + 2) {
			sum[x] += k;
			x += lowbit(x);
		}
	}

	int query(int x) {
		int ans= 0;
		while (x) {
			ans += sum[x];
			x -= lowbit(x);
		}
		return ans;
	}
} bit;
int mx[N][20], lst[N], ans[N];

/*int st(int l, int r) {
	unsigned b = log(r - l + 1) / log(2);
	return max(mx[l][b], mx[r - (1 << b) + 1][b]);
}*/

int main() {
	//freopen("stack.in", "r", stdin);
	//freopen("stack.out", "w", stdout);
	n = read(); q = read();
	for (int i = 1; i <= n; i++) a[i].a = read();
	for (int i = 1; i <= n; i++) mx[i][0] = a[i].b = read();
	for (int i = 1; i <= n; i++) 
		if (i > 1 && a[i].a == a[i - 1].a) lst[i] = lst[i - 1];
		else lst[i] = i;
	/*for (int j = 1; (1 << j) <= n; j++)
		for (int i = 1; i <= (n - (1 << j) + 1); i++)
			mx[i][j] = max(mx[i][j - 1], mx[i + (1 << (j - 1))][j - 1]);*/
	for (int i = 1; i <= q; i++) {
		int l = read(), r = read();
		as[r].push_back(make_pair(l, i));
	}
	for (int i = 1; i <= n; i++) {
		int p = i - 1;
		while (p && (a[i].a == a[p].a || a[i].b >= a[p].b)) p = lst[p] - 1;
		lst[i] = p + 1;
		//printf("%d\n", p + 1);
		bit.add(p + 1, 1); bit.add(i + 1, -1);
		
		/*while (p) {
			
			p = lst[p];
		}*/
		for (auto j : as[i]) ans[j.second] = bit.query(j.first);
	}
	for (int i = 1; i <= q; i++) printf("%d\n", ans[i]);
	return 0;
}