Can someone help me with this problem
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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.