Submission #45425

#	Time	Username	Problem	Language	Result	Execution time	Memory
45425		choikiwon	Maxcomp (info1cup18_maxcomp)	C++17	100 / 100	198 ms	4660 KiB

maxcomp

#include<bits/stdc++.h>
using namespace std;

int N, M;
int A[1010][1010];
int mn1[1010], mn2[1010];

int main() {
    scanf("%d %d", &N, &M);

    for(int i = 0; i < N; i++) {
        for(int j = 0; j < M; j++) {
            scanf("%d", &A[i][j]);
        }
    }

    int ans = -2e9;

    for(int i = 0; i < M; i++) {
        mn1[i] = 2e9;
        mn2[i] = 2e9;
    }

    for(int i = N - 1; i >= 0; i--) {
        int tmn1 = 2e9;
        int tmn2 = 2e9;
        for(int j = 0; j < M; j++) {
            ans = max(ans, A[i][j] + i - j - tmn1 - 1);
            mn1[j] = min(mn1[j], A[i][j] + i - j);
            tmn1 = min(tmn1, mn1[j]);
        }
        for(int j = M - 1; j >= 0; j--) {
            ans = max(ans, A[i][j] + i + j - tmn2 - 1);
            mn2[j] = min(mn2[j], A[i][j] + i + j);
            tmn2 = min(tmn2, mn2[j]);
        }
    }

    for(int i = 0; i < M; i++) {
        mn1[i] = 2e9;
        mn2[i] = 2e9;
    }

    for(int i = 0; i < N; i++) {
        int tmn1 = 2e9;
        int tmn2 = 2e9;
        for(int j = M - 1; j >= 0; j--) {
            mn1[j] = min(mn1[j], A[i][j] - (i - j));
            tmn1 = min(tmn1, mn1[j]);
            ans = max(ans, A[i][j] - (i - j) - tmn1 - 1);
        }
        for(int j = 0; j < M; j++) {
            mn2[j] = min(mn2[j], A[i][j] - (i + j));
            tmn2 = min(tmn2, mn2[j]);
            ans = max(ans, A[i][j] - (i + j) - tmn2 - 1);
        }
    }

    printf("%d", ans);
}

Compilation message (stderr)

maxcomp.cpp: In function 'int main()':
maxcomp.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &M);
     ~~~~~^~~~~~~~~~~~~~~~~
maxcomp.cpp:13:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &A[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~

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