$\Huge \texttt{P1130 红牌}$

#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int Time[2001][2001];
long long Joker[2001][2001];
int main() {
	int N,M;
	cin >> N >> M;
	for(int i = 1; i <= M; i ++ ) {
		for(int j = 1; j <= N; j ++ ) {
			cin >> Time[j][i];
		}
	}
	cout << endl;
	for(int i = 1; i <= N; i ++ ) {
		for(int j = 1; j <= M; j ++ ) {
			Joker[i][j] = Time[i][j] + 
			min(Joker[i - 1][j],Joker[i - 1][j % M + 1]);
		}
	}
	long long answer = (long long)pow(2,63) - 1;
	for(int i = 1; i <= M; i ++ ) {
		answer = min(answer,Joker[N][i]);
	}
	cout << answer;
	return 0;
}

一个点都没过……（知道为什么听取WA声一片了吗

回复请At。