| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 1 | maomao90 | 161 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | -is-this-fft- | 148 |
| 5 | SecondThread | 148 |
| 5 | atcoder_official | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 10 | TheScrasse | 143 |
Hi community, recently I found this contest and i am curious to know how to solve problem BOXING BOOKS.My first tought was a dp solution
dp[i][j] = min(dp[i][j], dp[r][j — 1] + cost(i,j))
Obviusly, this solution will give TLE, My question is Can this problem be solve using Divide and Conquer? There is a simplest solution?
Thanks.
Your solution doesn't give TLE, the time limit is 5 seconds. But if you want to do it in n * k time, it may be possible by using some convex hull trick reasoning