Hi i want to solve this problem using Dynamic programming. Please provide some hint Problem: http://topcoder.bgcoder.com/print.php?id=596
Hi i want to solve this problem using Dynamic programming. Please provide some hint Problem: http://topcoder.bgcoder.com/print.php?id=596
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
i am not able to formulate the optimal substructure. i just need hint on that
The constraints are too low, you brute force it recursively, along with a memorization. In the editorial, the writer mention an 'matrix multiplication' like solution, but I don't even mind how to start coding such a solution