P1130 红牌 dp

​​传送门​​ 思路：这个题跟数字三角很像，但它是’横着‘走的，这样会导致数据更新不及时，不能完成准确的记忆化搜索，所以我们可以先对矩阵做一下处理，然后再dp.

/**
* From:
* Qingdao Agricultural University
* Created by XiangwangAcmer
* Date : 2019-10-05-09.33.20
* Talk is cheap.Show me your code.
*/
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<cmath>
#include<cctype>
#include<stack>
#include<map>
#include<string>
#include<cstdlib>
#define ll long long
using namespace std;
const ll maxn = 1e6 + 5;
const ll minn = 1e9 + 5;
const ll mod = 1000000007;
const int INF = 0x3f3f3f3f;
const long long LIMIT = 4294967295LL;
vector<int>v[maxn];
int dp[2002][2002], a[2002][2002];
vector<int>G[maxn];
bool row[maxn], col[maxn];
bool flag = 0;
queue<int>q;
int minnn = minn;
int main() {
    ios::sync_with_stdio(false);
    int m, n;
    cin >> m >> n;///4 3
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            cin >> a[i][j];
    for(int i=1;i<=m;i++){
        for(int j=n;j>=1;j--)
            {if(j!=1)
            dp[j][i]=min(dp[j][i-1],dp[j-1][i-1])+a[j][i];
            else
        dp[j][i]=min(dp[j][i-1],dp[n][i-1])+a[j][i];
         }
    }
    int minnn=minn;
    for(int i=1;i<=n;i++)
        minnn=min(minnn,dp[i][m]);
    cout<<minnn<<endl;
    return 0;
}