| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 163 |
| 2 | adamant | 163 |
| 4 | maroonrk | 152 |
| 5 | nor | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | TheScrasse | 147 |
| 7 | atcoder_official | 147 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
interesting problem
you are given an array A of n positive integer and r moves.
on each move: you can choose any subarray of A (which contains only positive elements) and decrease all elements in that subarray by one.
your task is to maximize the number of 0 values in your array.
print that number after r moves.
input:
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
TuHoangAnh | 2022-07-14 15:51:45 | 6 | ||
| en2 |
|
TuHoangAnh | 2022-07-14 15:48:16 | 378 | Tiny change: 'n\n$4$\n\n' -> 'n\n$4$\n\n- **subtask1:** $n<=10;r=1$\n- **subtask2:** $n<=10;r=1$\n' (published) | |
| en1 |
|
TuHoangAnh | 2022-07-14 15:30:23 | 354 | Initial revision (saved to drafts) |
