解题思路: 思路详解在:https://www.acwing.com/solution/content/228403/
参考代码:
const int N = 1e5; #include <iostream> using namespace std; const int N = 1e5 + 10, M = 2e6 + 5; struct node{ int l, r; int m; }tr[4 * N]; int a[N], b[M],c[N], n, m, x; void pushup(int u) { tr[u].m = min(tr[u << 1].m, tr[u << 1 | 1].m); } void build(int u, int l, int r) { if (l == r)tr[u] = { l,r,c[l] }; else { tr[u] = { l,r}; int mid = l + r >> 1; build(u << 1, l, mid); build(u << 1 | 1, mid + 1, r); pushup(u); } } int query(int u, int l, int r) { if (tr[u].l >= l && tr[u].r <= r)return tr[u].m; int mid = tr[u].l + tr[u].r >> 1; int res = n + 1; if (l <= mid)res = query(u << 1, l, r); if (r > mid)res = min(res, query(u << 1 | 1, l, r)); return res; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m >> x; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = n; i >= 1; i--) { if (!b[a[i] ^ x]) c[i] = n + 1; else c[i] = b[a[i] ^ x]; b[a[i]] = i; } build(1, 1, n); while (m--) { int l, r; cin >> l >> r; int mi = query(1, l, r); if (r >= mi) cout << "yes\n"; else cout << "no\n"; } return 0; }
0.0分
0 人评分
点我有惊喜!你懂得!浏览:1338 |
C语言训练-求矩阵的两对角线上的元素之和 (C语言代码)浏览:707 |
弟弟的作业 (C++代码)浏览:1304 |
2003年秋浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:605 |
C语言程序设计教程(第三版)课后习题9.2 (C语言代码)浏览:556 |
DNA (C语言描述,蓝桥杯)浏览:1555 |
Cylinder (C语言描述+详细分析)浏览:3266 |
IP判断 (C语言代码)浏览:539 |
时间转换 (C语言代码)浏览:628 |
A+B for Input-Output Practice (I) (C语言代码)浏览:574 |