Submission

Score: 0

User: Zonezonee

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

Language: cpp

Time: 0.004 second

Submitted On: 2025-12-26 21:34:43

#include <bits/stdc++.h>
using namespace std;
const int N = 1e3+10;

int a[N][N], dp1[N][N], dp2[N][N];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j){
            cin >> a[i][j];
        }
    }
    // -3 -9 -12
    // -1 1 -2
    for(int i = 0; i <= n; ++i) for(int j = 0; j <= m; ++j) dp1[i][j] = dp2[i][j] = -1e9;
    dp1[1][1] = a[1][1];
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j){
            if(i == 1 && j == 1) continue;
            dp1[i][j] = max(dp1[i-1][j], dp1[i][j-1])+a[i][j];
        }
    }
    dp2[1][1] = a[1][1];
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j){
            if(i == 1 && j == 1) continue;
            dp2[i][j] = min(dp1[i][j], max(dp2[i-1][j], dp2[i][j-1]));
        }
    }
    if(dp2[n][m] <= 0) dp2[n][m]--;
    cout << abs(min(0, dp2[n][m])) << '\n';
}