全WA萌新求条
  • 板块P1130 红牌
  • 楼主OJ_killer
  • 当前回复2
  • 已保存回复2
  • 发布时间2024/10/6 10:11
  • 上次更新2024/10/6 10:49:04
查看原帖
全WA萌新求条
1178898
OJ_killer楼主2024/10/6 10:11

感觉式子推的是对的啊,why 0pts?


#include <bits/stdc++.h>
using namespace std;

int n, m, a[2001][2001], f[2001][2001], ans = 1 << 30;

int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			cin >> a[i][j];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (j == 1)
				f[i][j] = min(f[i - 1][j], f[i - 1][m]) + a[i][j];
			else
				f[i][j] = min(f[i - 1][j], f[i - 1][j - 1]) + a[i][j];
		}
	}
	for (int i = 1; i <= m; ++i)
		ans = min(ans, f[n][i]);
	cout << ans + 1;
	return 0;
}
2024/10/6 10:11
加载中...