整数序列区间查询：求解包含指定元素的极好区间最大权值

```python n = int(input()) a = list(map(int, input().split())) # 前缀和数组 prefix_sum = [0] * (n + 1) for i in range(1, n + 1): prefix_sum[i] = prefix_sum[i - 1] + a[i - 1] q = int(input()) for _ in range(q): L, R = map(int, input().split()) ans = 0 for i in range(1, n + 1): k = float('-inf') for l in range(1, i + 1): for r in range(i, n + 1): length = r - l + 1 if L <= length <= R: value = prefix_sum[r] - prefix_sum[l - 1] k = max(k, value) ans ^= (i * k) % (1 << 64) print(ans) ``` ######[AI问答 | 224点数解答 | 2025-12-10 22:14:58]