Submission

Score: 100

User: kenmuay

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

Language: cpp

Time: 0.121 second

Submitted On: 2026-03-01 21:36:13

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

const int maxn = 1e3+10;
int c[maxn][maxn];
long long dp[maxn][maxn];

int main() {
    cin.tie(nullptr)->sync_with_stdio(0);
    int n,m;
    cin >> n >> m;
    
    for(int i=0; i<=n; i++){
        for(int j=0; j<=m; j++){
            if(i==0 || j==0){
                dp[i][j] = -1e15;
                continue;
            }
            cin >> c[i][j];
        }
    }
    long long L=1, R=1e12;
    while(L<R){
        long long mid = (R-L)/2+L;
        long long st = mid+c[1][1];
        if(st <= 0) dp[1][1] = -1e15;
        else dp[1][1] = st;
        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])+c[i][j];
                if(dp[i][j]<=0) dp[i][j] = -1e15;
            }
        }
        if(dp[n][m] < 1) L=mid+1;
        else R=mid;
    }
    cout << L;
}