Hello!
My submission is getting WA on test 21, since there's no editorial I can't see the desired solution and I can't figure out where my mistake is.
Here is the link : http://codeforces.net/contest/279/submission/20043264
Thanks for help!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hello!
My submission is getting WA on test 21, since there's no editorial I can't see the desired solution and I can't figure out where my mistake is.
Here is the link : http://codeforces.net/contest/279/submission/20043264
Thanks for help!
Name |
---|
The approach I used is to define R[i] = how much to the right can I go from i so that the elements don't decrease and L[i] = how much to the left can I go from i so that the elements don't decrease. We can compute this in linear time. Then to answer a query, I simply check if R[l] > = L[r].