Submission

Score: 100

User: MiyaZaki1072

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

Language: cpp

Time: 0.120 second

Submitted On: 2025-04-18 19:41:49

#include <bits/stdc++.h>
using namespace std;
int a[1100][1100];
int dp[1010][1010],n,m;
bool calc(int mid){
    memset(dp,-0x3f,sizeof dp);
    dp[1][1] = mid+a[1][1];
    if(dp[1][1] <=0)return 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(i==1 && j==1)continue;
            if(i)dp[i][j] = dp[i-1][j];
            if(j)dp[i][j] = dp[i][j-1];
            if(i && j)dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
            dp[i][j]+=a[i][j];
            if(dp[i][j]<=0)dp[i][j]=-2e9;
        }
    }
    return dp[n][m]>0;
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>a[i][j];
        }
    }
    int l = 1, r=2e9;
    while(l<r){
        int mid = (l+r)/2;
        if(calc(mid))r=mid;
        else l=mid+1;
    }
    cout<<l;
}