Submission

Score: 100

User: Zonezonee

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

Language: cpp

Time: 0.093 second

Submitted On: 2025-12-26 22:42:10

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