http://mirror.codeforces.com/contest/281/problem/D
can somebody suggest an approach to this problem
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
http://mirror.codeforces.com/contest/281/problem/D
can somebody suggest an approach to this problem
Name |
---|
i looked at that can u please explain what is happening
for each number in the sequence A[i],
We define: MaxRight[i] = r ... where r is the smallest index where A[r]>A[i] and r>i
Also MaxLeft[i] = l ... where l is the largest index where A[l]>A[i] and l<i
If we checked the intervals [i,r] (A[r] XOR A[i]) , [l,i] (A[l] XOR A[i]) and [l,r] (A[l] XOR A[i]) for each index i ... We will cover all possible answers for any interval.
Now we need to find an efficient way to compute MaxRight[i] and MaxLeft[i]
For Computing MaxLeft[i] ... I'll check A[i-1] ...
if A[i-1] > A[i] ... Then, MaxLeft[i]=i-1
else ... we will need to check A[MaxLeft[i-1]] (Previously computed value)
Till we find the first maximum to the left.
The Same strategy can be done for MaxRight[i] ... but we will need to check A[i+1] instead and we will compute the values in reversed order.