Submission

Score: 0

User: hyyh

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-01-12 22:57:44

#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <set>
#include <bitset>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = tuple<int,int,int>;
#define endl '\n'
#define f first
#define s second

int const diaphantineequationformutidimentionalcalculation = 1010;

int dp[diaphantineequationformutidimentionalcalculation][diaphantineequationformutidimentionalcalculation];

int main(){
    memset(dp,1e9,sizeof dp);
    int n,m;cin >> n >> m;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            int g;cin >> g;
            dp[i][j] = max(min(dp[i-1][j],dp[i][j-1]) - g,1);
            //cout << dp[i][j] << " ";
        }
        //cout << endl;
    }
    cout << dp[n][m];
}