# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
45530 | 2018-04-15T00:54:00 Z | IvanC | Maxcomp (info1cup18_maxcomp) | C++17 | 3 ms | 552 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e3 + 10; const int INF = 1e9 + 1e4; int N,M,matriz[MAXN][MAXN],linear[MAXN],melhor; int main(){ scanf("%d %d",&N,&M); melhor = 0; for(int i = 1;i<=N;i++){ for(int j = 1;j<=M;j++){ scanf("%d",&matriz[i][j]); } } for(int i = 1;i<=N;i++) linear[i] = INF; for(int j = 1;j<=M;j++){ int menor = INF; for(int i = 1;i<=N;i++){ linear[i] = min(linear[i] + 1, matriz[i][j] ); menor = min(menor+1,linear[i]); melhor = max(melhor, matriz[i][j] - menor ); } } for(int i = 1;i<=N;i++) linear[i] = INF; for(int j = M;j>=1;j--){ int menor = INF; for(int i = 1;i<=N;i++){ linear[i] = min(linear[i] + 1, matriz[i][j] ); menor = min(menor+1,linear[i]); melhor = max(melhor, matriz[i][j] - menor ); } } printf("%d\n",melhor - 1); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 428 KB | Output is correct |
4 | Correct | 2 ms | 428 KB | Output is correct |
5 | Correct | 2 ms | 480 KB | Output is correct |
6 | Correct | 2 ms | 480 KB | Output is correct |
7 | Incorrect | 2 ms | 480 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 492 KB | Output is correct |
2 | Correct | 2 ms | 544 KB | Output is correct |
3 | Correct | 2 ms | 552 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 428 KB | Output is correct |
4 | Correct | 2 ms | 428 KB | Output is correct |
5 | Correct | 2 ms | 480 KB | Output is correct |
6 | Correct | 2 ms | 480 KB | Output is correct |
7 | Incorrect | 2 ms | 480 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 428 KB | Output is correct |
4 | Correct | 2 ms | 428 KB | Output is correct |
5 | Correct | 2 ms | 480 KB | Output is correct |
6 | Correct | 2 ms | 480 KB | Output is correct |
7 | Incorrect | 2 ms | 480 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |