Description: Using f[i][j] to represent the minimum cost from I to j will turn I from J to i->z->j, K represents the number of sites to go, and the initial location is I, so the end point is i+k, which ensures the last segment is k,
Platform: |
Size: 262144 |
Author: mazr
|
Hits: