蓝桥杯a组 选数异或

考虑dp，dp[i]表示以i结尾可以选的最大l（左边界），last数组表示上一个目标值的位置。则转移式子为dp[i]=max(dp[i-1],last[a[i]^x]);

/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
typedef pair<int, int> pii;
#define int long long
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
int last[100005];
int dp[100005];
int a[100005];
signed main() {
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m, x;
    cin >> n >> m >> x;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        last[a[i]] = i;
        dp[i] = max(dp[i - 1], last[(a[i] ^ x)]);
    }
    while (m--) {
        int l, r;
        cin >> l >> r;
        if (dp[r] >= l) {
            cout << "yes" << endl;
        } else {
            cout << "no" << endl;
        }
    }
    return 0;
}