Submission

Score: 0

User: Zonezonee

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

Language: cpp

Time: 0.097 second

Submitted On: 2025-12-26 22:25:19

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

int a[N][N], dp[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];
        }
    }
    for(int i = 0; i <= n; ++i) for(int j = 0; j <= m; ++j) dp[i][j] = -1e9;
    dp[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;
            dp[i][j] = max(dp[i-1][j], dp[i][j-1])+a[i][j];
        }
    }
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j){
            if(i == 1 && j == 1) continue;
            dp[i][j] = min(dp[i][j], max(dp[i-1][j], dp[i][j-1]));
        }
    }
    if(dp[n][m] <= 0) dp[n][m]--;
    cout << abs(min(1, dp[n][m])) << '\n';
}