Submission #316993

#	Time	Username	Problem	Language	Result	Execution time	Memory
316993		daniel920712	Maxcomp (info1cup18_maxcomp)	C++14	60 / 100	1096 ms	12792 KiB

maxcomp

#include <iostream>
#include <stdio.h>
#include <stdlib.h>

using namespace std;
int all[1005][1005];
int main()
{
    int N,M,ans=-2e9,i,j,k,l;
    scanf("%d %d",&N,&M);
    for(i=0;i<N;i++) for(j=0;j<M;j++) scanf("%d",&all[i][j]);
    for(i=0;i<N;i++)
    {
        for(j=0;j<N;j++)
        {
            for(k=0;k<M;k++)
            {
                for(l=0;l<M;l++) 
                {
                    if(i==j&&k==l) continue;
                    ans=max(ans,abs(all[i][k]-all[j][l])-abs(i-j)-abs(k-l)-1);
                }
            }
        }
    }
    printf("%d\n",ans);
    return 0;
}

Compilation message (stderr)

maxcomp.cpp: In function 'int main()':
maxcomp.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
maxcomp.cpp:11:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 |     for(i=0;i<N;i++) for(j=0;j<M;j++) scanf("%d",&all[i][j]);
      |                                       ~~~~~^~~~~~~~~~~~~~~~~

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