Submission #410707

#	Time	Username	Problem	Language	Result	Execution time	Memory
410707		nichke	Maxcomp (info1cup18_maxcomp)	C++14	60 / 100	1086 ms	20284 KiB

maxcomp

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'

int n, m, ans = -2;
int ar[3005][3005];

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> ar[i][j];
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			for (int k = 0; k < n; k++) {
				for (int l = 0; l < m; l++) {
					int tmp = max(ar[i][j], ar[k][l]) - min(ar[i][j], ar[k][l]);
					if (i == k && j == l) {
						tmp--;
					} else if (i == k) {
						tmp -= abs(j - l) + 1;
					} else if (j == l) {
						tmp -= abs(i - k) + 1;
					} else {
						tmp -= abs(i - k) + abs(j - l) + 1;
					}
					ans = max(ans, tmp);
				}
			}
		}
	}
	cout << ans << '\n';
	return 0;
}

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