| Time Limit | $2$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $5$ | 正确数量 | $2$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 |
Xiao Ming likes to play mathematical games very much. One day, he gets a sequence of n positive integers. XOR (l , r) is defined as the XOR and of all numbers in a continuous interval. Now, Xiao Ming wants to know the intervals which make the XOR (l , r) become largest.
Require l, r.
There is an integer T at the first line, indicate the case of data.
In each case, there is an integer N at the first line, indicate the length of the sequence. And there are N integers, a1, a2, … , an, at the second line. (N <= 1,000,000)
In each case, the first line is “Case #k:”, k is the number of test cases, the next line includes two integers l and r, which separated by a space.
l, r output in lexicographic order if there are multiple results.
1
5
1 2 3 4 5
Case #1:
3 4
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$875 $ms] | 淡意的温柔 | 588190 | 2020-05-28 11:10:00 |
| 内存最少[$0 $KB] | 淡意的温柔 | 588190 | 2020-05-28 11:10:00 |
| 第一AC | 淡意的温柔 | 588190 | 2020-05-28 11:10:00 |
| 第一挑战 | AOJ大管家 | 84158 | 2017-04-26 12:51:59 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|