Hi friends,can anyone suggest away of doing the following problem in O(n) time using DP. 327A - Игра с переворачиванием
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | cry | 158 |
4 | nor | 157 |
5 | atcoder_official | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
7 | Um_nik | 154 |
7 | adamant | 154 |
10 | Petr | 147 |
Hi friends,can anyone suggest away of doing the following problem in O(n) time using DP. 327A - Игра с переворачиванием
Название |
---|
A solution was posted in this editorial. The algorithm the author is referring to at the end of his solution is called Kadane's Algorithm. You can find an explanation here.
I don't understand why are you asking when there is an editorial? Is it so hard to click on the tutorial button on the right of the problem statement? And BTW, this is one of the few good and detailed editorials on codeforces.
Because my O(n) submission using Kadane's algo is giving wrong answer! :) 10026842
Then you should have mentioned that in your post, shouldn't you?