# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413218 | aris12345678 | Maxcomp (info1cup18_maxcomp) | C++14 | 157 ms | 17032 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 <bits/stdc++.h>
using namespace std;
const int mxN = 1e3+5;
int a[mxN][mxN], dp[mxN][mxN];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
dp[i][j] = a[i][j]-1;
if(i > 0)
dp[i][j] = max(dp[i][j], dp[i-1][j]-1);
if(j > 0)
dp[i][j] = max(dp[i][j], dp[i][j-1]-1);
}
}
for(int i = n-1; i >= 0; i--) {
for(int j = m-1; j >= 0; j--) {
if(i < n-1)
dp[i][j] = max(dp[i][j], dp[i+1][j]-1);
if(j < m-1)
dp[i][j] = max(dp[i][j], dp[i][j+1]-1);
}
}
int ans = -1;
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
ans = max(ans, dp[i][j]-a[i][j]);
}
}
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... |