I am not getting any idea how to approach this problem Please help https://codeforces.com/problemset/problem/234/C
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | maroonrk | 152 |
4 | nor | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
I am not getting any idea how to approach this problem Please help https://codeforces.com/problemset/problem/234/C
Название |
---|
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.