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.me/contest/279/submission/20043264
Thanks for help!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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.me/contest/279/submission/20043264
Thanks for help!
Название |
---|
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].