传送门

幼儿园DP。

——代码

1 #include <cstdio> 2 #include <iostream> 3 4 const int MAXN = 2001; 5 int n, m, ans = ~(1 << 31); 6 int a[MAXN][MAXN], f[MAXN][MAXN]; 7 8 inline int read() 9 16 17 inline int min(int x, int y) 18 21 22 int main() 23 36 for(i = 1; i <= m; i++) ans = min(ans, f[n][i]); 37 printf("%d\n", ans); 38 return 0; 39 }
View Code