80分求调

#include <bits/stdc++.h>
using namespace std;
const int N = 1009;
int n, m, p;
int gold[N][N], cost[N], f[N];

int main() {
	scanf("%d%d%d", &n, &m, &p);
	for (int i = 1; i <= n; i ++) 
		for (int j = 1; j <= m; j ++) 
			scanf("%d", &gold[i][j]);
	for (int i = 1; i <= n; i ++) scanf("%d", &cost[i]);
	for (int i = 1; i <= m; i ++) {
		for (int j = 1; j <= n; j ++) {
			int tmp = f[i - 1] - cost[j];
			for (int k = 1; k <= (m - i + 1, p); k ++) {
				int road = j + k - 1;
				if (road > n) road -= n;
				int time = i + k - 1;
				tmp += gold[road][time];
				f[time] = max(f[time], tmp); 
			} 
		} 
	}
	printf("%d", f[m]);
	return 0;
}