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 | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 155 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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].