Submission #762149

#	Time	Username	Problem	Language	Result	Execution time	Memory
762149		Trunkty	Maxcomp (info1cup18_maxcomp)	C++14	100 / 100	97 ms	24600 KiB

maxcomp

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

int n,m,ans;
int arr[1005][1005];
int maxi[1005][1005];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin >> arr[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            maxi[i][j] = arr[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            maxi[i][j] = max(maxi[i][j],maxi[i-1][j]-1);
        }
        for(int j=1;j<=m;j++){
            maxi[i][j] = max(maxi[i][j],maxi[i][j-1]-1);
        }
        for(int j=m;j>=1;j--){
            maxi[i][j] = max(maxi[i][j],maxi[i][j+1]-1);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            ans = max(ans,maxi[i][j]-arr[i][j]);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            maxi[i][j] = arr[i][j];
        }
    }
    for(int i=n;i>=1;i--){
        for(int j=1;j<=m;j++){
            maxi[i][j] = max(maxi[i][j],maxi[i+1][j]-1);
        }
        for(int j=1;j<=m;j++){
            maxi[i][j] = max(maxi[i][j],maxi[i][j-1]-1);
        }
        for(int j=m;j>=1;j--){
            maxi[i][j] = max(maxi[i][j],maxi[i][j+1]-1);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            ans = max(ans,maxi[i][j]-arr[i][j]);
        }
    }
    cout << ans-1LL << "\n";
    return 0;
}

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