oj.uz

답안 #923306

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923306 2024-02-07T05:41:14 Z vjudge1 Maxcomp (info1cup18_maxcomp) C++17
0 / 100
 0 ms 348 KB 
#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++){
            a[i][j]-=i;
            a[i][j]-=j;
            ans=max(ans,a[i][j]-mn[i][j]);
        }
    }
    for(int i=0;i<n;i++){
        reverse(a[i],a[i]+m);
    }
    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;
            a[i][j]-=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

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

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -