Submission #923309

#	Time	Username	Problem	Language	Result	Execution time	Memory
923309		vjudge1	Maxcomp (info1cup18_maxcomp)	C++17	0 / 100	0 ms	348 KiB

maxcomp

#include <bits/stdc++.h>
#define int long long 
using namespace std;
string yn(bool ans,string y="YES",string n="NO"){
    return (ans?y:n);
}
#define all(a) a.begin(),a.end()
void gogo(){
    int n,m;
    cin>>n>>m;
    int a[n][m];
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
        }
    }
    int ans=-INT_MAX;
    int mn[n+1][n+1];
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            mn[i][j]=a[i][j]-i-j;
            if(i>0){
                mn[i][j]=min(mn[i][j],mn[i-1][j]);
            }
            if(j>0){
                mn[i][j]=min(mn[i][j],mn[i][j-1]);
            }
            if(j and i){
                mn[i][j]=min(mn[i][j],mn[i-1][j-1]);
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            ans=max(ans,a[i][j]-i-j-mn[i][j]);
            a[i][j]=-a[i][j];
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            mn[i][j]=a[i][j]-i-j;
            if(i>0){
                mn[i][j]=min(mn[i][j],mn[i-1][j]);
            }
            if(j>0){
                mn[i][j]=min(mn[i][j],mn[i][j-1]);
            }
            if(j and i){
                mn[i][j]=min(mn[i][j],mn[i-1][j-1]);
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            a[i][j]-=i+j;
            ans=max(ans,a[i][j]-mn[i][j]);
        }
    }
    cout<<ans-1<<endl;
}
main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    long long  t=1;
    // cin>>t;
    while(t--){
        gogo();
    }
}

Compilation message (stderr)

maxcomp.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main(){
      | ^~~~

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