제출 #467001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
467001		LucaIlie	Maxcomp (info1cup18_maxcomp)	C11	15 / 100	1 ms	204 KiB

maxcomp

#include <stdio.h>

#define MAX_N 1000

int a[MAX_N][MAX_N];

int abs( int a ) {
    return a > 0 ? a : -a;
}

int main() {
    int n, m, maxW, w, l, c, l1, c1, l2, c2;

    scanf( "%d%d", &n, &m );
    for ( l = 0; l < n; l++ ) {
        for ( c = 0; c < m; c++ )
            scanf( "%d", &a[l][c] );
    }

    maxW = -1;
    for ( l1 = 0; l1 < n; l1++ ) {
        for ( c1 = 0; c1 < m; c1++ ) {
            for ( l2 = 0; l2 <= l1; l2++ ) {
                for ( c2 = 0; c2 <= c1; c2++ ) {
                    w = abs( a[l1][c1] - a[l2][c2] ) - (l1 - l2 + c1 - c2 + 1);
                    if ( w > maxW )
                        maxW = w;
                }
            }
        }
    }

    printf( "%d", maxW );

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

maxcomp.c: In function 'main':
maxcomp.c:14:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf( "%d%d", &n, &m );
      |     ^~~~~~~~~~~~~~~~~~~~~~~
maxcomp.c:17:13: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |             scanf( "%d", &a[l][c] );
      |             ^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 15
• Subtask 2: 15 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40