[luoguP1130] 红牌（DP）

传送门

幼儿园DP。

——代码

 #include <cstdio>
 #include <iostream>

 const int MAXN = ;
 int n, m, ans = ~( << );
 int a[MAXN][MAXN], f[MAXN][MAXN];

 inline int read()
 {
     int x = , f = ;
     char ch = getchar();
     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;
     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';
     return x * f;
 }

 inline int min(int x, int y)
 {
     return x < y ? x : y;
 }

 int main()
 {
     int i, j;
     n = read();
     m = read();
     for(i = ; i <= m; i++)
         for(j = ; j <= n; j++)
             a[i][j] = read();
     for(i = ; i <= n; i++)
     {
         f[i][] = min(f[i - ][], f[i - ][m]) + a[][i];
         for(j = ; j <= m; j++)
             f[i][j] = min(f[i - ][j], f[i - ][j - ]) + a[j][i];
     }
     for(i = ; i <= m; i++) ans = min(ans, f[n][i]);
     printf("%d\n", ans);
     return ;
 }