### ygd161837jn2n313's blog

By ygd161837jn2n313, history, 6 weeks ago,

• -9

 » 6 weeks ago, # |   0 Not really a $dp$ approach , but you can keep $dp_i$ as being the minimal number of steps to reach $i$. We can use dijkstra / 0-1 bfs to calculate this $dp$.
•  » » 6 weeks ago, # ^ |   0 thanks