For submission #287793085, I used dp and matrix to solve the problem. it seems that the memory limit is exceed. I know that a lot of people solve the problem using a map, but I am still curious whether using dp and matrix could be a successful solution with modifications in some way.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3904 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3494 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | maroonrk | 3350 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 159 |
| 5 | awoo | 157 |
| 5 | adamant | 157 |
| 7 | -is-this-fft- | 156 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/25/2024 20:17:42 (h1).
Desktop version, switch to mobile version.
Supported by
I recommend you see this problem, this help you with D: https://cses.fi/problemset/task/1661
the solution: https://usaco.guide/problems/cses-1661-subarray-sums-ii/solution
Note: also we need of some greedy for select the intervals, only select the with the first end for having the most intervals, i forgot what called the problems is :/