Submission

Score: 0

User: kormuyang

Problemset: อัศวินขี่ม้าขาว

Language: cpp

Time: 0.010 second

Submitted On: 2025-11-13 00:06:08

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define MAX_N 1000

vector<vector<int>> dp(MAX_N + 1, vector<int>(MAX_N + 1, INT_MIN)), ans(MAX_N + 1, vector<int>(MAX_N + 1, INT_MIN));

int32_t main() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> dp[i][j];
            if (i != 1 || j != 1) {
                dp[i][j] += max(dp[i - 1][j], dp[i][j - 1]);
            }
            ans[i][j] = dp[i][j];
            if (i != 1 || j != 1) {
                ans[i][j] = min(ans[i][j], max(ans[i - 1][j], ans[i][j - 1]));
            }
        }
    }
    cout << abs(ans[n][m]) + 1 << '\n';
    return 0;
}