# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127297 | E869120 | Maxcomp (info1cup18_maxcomp) | C++14 | 188 ms | 17100 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <cassert>
using namespace std;
#pragma warning (disable: 4996)
int N, M, A[1009][1009], dist[1009][1009];
int main() {
scanf("%d%d", &N, &M);
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) { scanf("%d", &A[i][j]); dist[i][j] = A[i][j] - 1; }
}
for (int i = 1; i <= N; i++) {
for (int j = 2; j <= M; j++) dist[i][j] = max(dist[i][j], dist[i][j - 1] - 1);
for (int j = M - 1; j >= 1; j--) dist[i][j] = max(dist[i][j], dist[i][j + 1] - 1);
}
for (int i = 1; i <= M; i++) {
for (int j = 2; j <= N; j++) dist[j][i] = max(dist[j][i], dist[j - 1][i] - 1);
for (int j = N - 1; j >= 1; j--) dist[j][i] = max(dist[j][i], dist[j + 1][i] - 1);
}
int maxn = -1;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) maxn = max(maxn, dist[i][j] - A[i][j]);
}
cout << maxn << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |