제출 #496962

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
496962		armashka	Maxcomp (info1cup18_maxcomp)	C++17	0 / 100	1 ms	352 KiB

maxcomp

#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            
 
struct dinamika {
	ll mx, mn, dist;
};

ll n, m, a[1005][1005], ans;
dinamika dp[1005][1005]; 

const void solve(/*Armashka*/) {
	cin >> n >> m;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= m; ++ j) {
			cin >> a[i][j];
			dp[i][j] = {a[i][j], a[i][j], 1};
		}
	}	
	for (int i = 1; i <= n; ++ i) dp[i][0] = {0, 0, inf};
	for (int i = 1; i <= m; ++ i) dp[0][i] = {0, 0, inf};
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= m; ++ j) {
			ll cur = dp[i][j].mx - dp[i][j].mn - dp[i][j].dist;
			ll sosed = max(dp[i - 1][j].mx, a[i][j]) - min(dp[i - 1][j].mn, a[i][j]) - (dp[i - 1][j].dist + 1);
			if (sosed > cur) {
				//cout << i - 1 << " " << j << " -> " << i << " " << j << "\n";
				dp[i][j] = {
					max(dp[i - 1][j].mx, a[i][j]),
					min(dp[i - 1][j].mn, a[i][j]),
					dp[i - 1][j].dist + 1
				};
			}
		    cur = dp[i][j].mx - dp[i][j].mn - dp[i][j].dist;
			sosed = max(dp[i][j - 1].mx, a[i][j]) - min(dp[i][j - 1].mn, a[i][j]) - (dp[i][j - 1].dist + 1);
			if (sosed > cur) {
				//cout << i << " " << j - 1 << " -> " << i << " " << j << "\n";
				dp[i][j] = {
                	max(dp[i][j - 1].mx, a[i][j]),
					min(dp[i][j - 1].mn, a[i][j]),    	
					dp[i][j - 1].dist + 1
				};
			}			
		}
	}
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= m; ++ j) {
			ans = max(ans, dp[i][j].mx - dp[i][j].mn - dp[i][j].dist);
			//cout << dp[i][j].mx - dp[i][j].mn - dp[i][j].dist << " ";
		} //cout << "\n";
	}
	cout << ans << "\n";
}
            
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40