Submission #639301

#TimeUsernameProblemLanguageResultExecution timeMemory
639301LucaLucaMMaxcomp (info1cup18_maxcomp)C++17
15 / 100
1 ms312 KiB
#include <bits/stdc++.h> using namespace std; struct cell { int x, i, j; }; bool operator < (const cell a, const cell b) { return a.x <= b.x; } cell a[1000001]; int main() { int n, m; cin >> n >> m; int N = 0; for (int i=0; i<n; i++) { for (int j=0; j<m; j++) { int x; cin >> x; a[++N].x = x; a[N].i = i, a[N].j = j; } } sort (a+1, a+N+1); int M = N/2 + 1; int ans = 0; for (int i=1; i<M; i++) { for (int j=N; j>=M; j--) { int d = abs(a[i].i - a[j].i) + abs(a[i].j - a[j].j) + 1; int s = a[j].x - a[i].x - d; ans = max(ans, s); } } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...