abc 250 E 思维，树状数组

题意：给定a，b两个数组，询问a的前x个和b的前y个构成的集合是否相同。

思路：对于a数组的每一项求出其在b数组出现的第一个位置，然后求一下前缀max，就知道b至少要这么大才能包含a，同理对b也这样，两个相互包含则相等。

/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
#include<map>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
map<int, int> mp, mp1;
int a[200005];
int b[200005];
int idx[200005];
int idx1[200005];
int f1[200005];
int f2[200005];
int n;
void updata(int x, int val) {
	while (x <= n) {
		f1[x] = max(f1[x], val);
		x += lowbit(x);
	}
}
int query(int x) {
	int ans = 0;
	while (x) {
		ans = max(ans, f1[x]);
		x -= lowbit(x);
	}
	return ans;
}
void updata1(int x, int val) {
	while (x <= n) {
		f2[x] = max(f2[x], val);
		x += lowbit(x);
	}
}
int query1(int x) {
	int ans = 0;
	while (x) {
		ans = max(ans, f2[x]);
		x -= lowbit(x);
	}
	return ans;
}
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++) {
		cin >> b[i];
	}
	for (int i = n; i >= 1; i--) {
		mp[a[i]] = i;
		mp1[b[i]] = i;
	}
	for (int i = 1; i <= n; i++) {
		if (mp1[a[i]] == 0) {
			idx[i] = 1e18;
		} else if (mp1[a[i]]) {
			idx[i] = mp1[a[i]];
		}
		if (mp[b[i]]) {
			idx1[i] = mp[b[i]];
		} else {
			idx1[i] = 1e18;
		}
	}
	for (int i = 1; i <= n; i++) {
		updata(i, idx[i]);
		updata1(i, idx1[i]);
	}
	int q;
	cin >> q;
	while (q--) {
		int x, y;
		cin >> x >> y;
		if (query(x) <= y && query1(y) <= x) {
			cout << "Yes" << endl;
		} else {
			cout << "No" << endl;
		}
	}
	return 0;
}