# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1085241 | medv | Maxcomp (info1cup18_maxcomp) | C++14 | 95 ms | 17088 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 <cstdio>
#include <algorithm>
#include <vector>
#define INF 1000000010
#define MAX 1010
using namespace std;
int n, m;
int a[MAX][MAX];
int dp[MAX][MAX];
int ans = -INF;
void f()
{
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
dp[i][j] = a[i][j];
if (i > 1)
dp[i][j] = max(dp[i][j], dp[i - 1][j] - 1);
if (j > 1)
dp[i][j] = max(dp[i][j], dp[i][j - 1] - 1);
ans = max(ans, dp[i][j] - a[i][j] - 1);
}
}
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]);
ans = -INF;
f();
for (int i = 1; i <= n / 2; i++)
for (int j = 1; j <= m; j++)
swap(a[i][j], a[n - i + 1][j]);
f();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m / 2; j++)
swap(a[i][j], a[i][m - j + 1]);
f();
for (int i = 1; i <= n / 2; i++)
for (int j = 1; j <= m; j++)
swap(a[i][j], a[n - i + 1][j]);
f();
printf("%d\n", ans);
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... |