# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467006 | LucaIlie | Maxcomp (info1cup18_maxcomp) | C11 | 1 ms | 332 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 <stdio.h>
#define MAX_N 1000
int a[MAX_N][MAX_N];
int abs( int a ) {
return a > 0 ? a : -a;
}
int main() {
FILE *fin, *fout;
int n, m, maxW, w, l, c, l1, c1, l2, c2;
fin = fopen( "maxcomp.in", "r" );
fscanf( fin, "%d%d", &n, &m );
for ( l = 0; l < n; l++ ) {
for ( c = 0; c < m; c++ )
fscanf( fin, "%d", &a[l][c] );
}
maxW = -1;
for ( l1 = 0; l1 < n; l1++ ) {
for ( c1 = 0; c1 < m; c1++ ) {
for ( l2 = 0; l2 < n; l2++ ) {
for ( c2 = 0; c2 < m; c2++ ) {
w = abs( a[l1][c1] - a[l2][c2] ) - abs( l1 - l2 ) - abs( c1 - c2 ) - 1;
if ( w > maxW )
maxW = w;
}
}
}
}
fout = fopen( "maxcomp.out", "w" );
fprintf( fout, "%d", maxW );
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... |