http://codeforces.com/contest/281/problem/D
can somebody suggest an approach to this problem
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
http://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.