I am not getting any idea how to approach this problem Please help https://codeforces.com/problemset/problem/234/C
I am not getting any idea how to approach this problem Please help https://codeforces.com/problemset/problem/234/C
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
Название |
---|
I used two-dimensional dp: dp[i][0] — if we continue negative sequence at index i dp[i][1] — if we continue positive sequence at index i
"state" is the number of changes needed to maintain a positive or negative sequence. Depending on the first element of the array we set base cases. Also, the last element of the sequence must be positive.
112223468
I prefer suffix-prefix sollution.
In fact, you don't even need dp. You need need to count the number of less than or equal to 0 and greater than or equal to 0s. The rest is unnecessary, and it's total possible without DP.
I also prefer this solution, but the author asked for dp approach.