| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
can any one help me in finding wrong test case
i cant figure out from codeforces wrong submission report
problem link :1490-G my submission :check here
thanks in advance UPD : got the mistake, array should have been long long type , instead of int type
The problem with your logic is how u are storing prefix. The prefix array wont be monotonically increasing. Consider the array $$$2, -3, -5, 10$$$. The prefix array would be $$$2, -1, -6, 4$$$. So you can't simply use lower_bound as it won't give correct position. So to solve this problem only store prefixes (with corresponding positions) that are in increasing order, i.e $$$2, 4$$$. In this you can use lower_bound and get the correct result.
My implementation
hi , i think my prefix array is non decreasing as it stores max of previous max_sum or current sum.Though I think array name made it a bit confusing as it doesn't stores prefixes at all .
ps : thanks for your code
Auto comment: topic has been updated by ashu_3916 (previous revision, new revision, compare).