Can someone help me with this problem
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
8 | SecondThread | 146 |
10 | pajenegod | 145 |
Name |
---|
Calculate $$$\textit{dp}(i, j)$$$ the minimum time to reach $$$a_i$$$ such that the bike is at position $$$j$$$ (prepend and append $$$0$$$ to array $$$a$$$ to make the implementation easier). To compute this $$$\textit{dp}$$$ array, consider transitions $$$\textit{dp}(i, j) \Rightarrow \textit{dp}(i + 1, j')$$$, meaning:
Code
Thanks a lot.