Submission #364809

#	Time	Username	Problem	Language	Result	Execution time	Memory
364809		tengiz05	Maxcomp (info1cup18_maxcomp)	C++17	60 / 100	1069 ms	16748 KiB

maxcomp

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 1005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int n, m, k;
int a[N][N];
void solve(int test_case){
	int i, j;
	cin >> n >> m;
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			cin >> a[i][j];
		}
	}
	int ans = -1e12;
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			for(int I=1;I<=n;I++){
				for(int J=1;J<=m;J++){
					int dist = (abs(I-i))+(abs(J-j)+1);
					chmax(ans, max(a[i][j], a[I][J]) - min(a[i][j], a[I][J]) - dist);
				}
			}
		}
	}
	cout << ans << '\n';
	return;
}

signed main(){
	FASTIO;
//~ #define MULTITEST 1
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

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