Submission #169320

#	Time	Username	Problem	Language	Result	Execution time	Memory
169320		Rouge_Hugo	Maxcomp (info1cup18_maxcomp)	C++14	15 / 100	9 ms	8312 KiB

maxcomp

#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
using namespace std;

int n,m;
const ll inf=1e11+10;
ll a[1009][1009];
ll b[1009][1009];
int main()
{
    fast;
    cin>>n>>m;
    for(int i=1;i<n+1;i++)
    {
        for(int j=1;j<m+1;j++)
        {
            cin>>a[i][j];
        }
    }
    ll re=0;
    for(int i=1;i<n+1;i++)
    {
        ll mx=0;
        for(int j=1;j<m+1;j++)
        {
            b[i][j]=max(b[i-1][j]-1,a[i][j]);
        }
        mx=b[i][1];
        for(int j=1;j<m+1;j++)
        {
            re=max(re,mx-a[i][j]-1);
            mx=max(mx,b[i][j]);
            mx--;
        }
    }
    memset(b,0,sizeof b);
    for(int j=1;j<m+1;j++)
        b[0][j]=inf;
    for(int i=1;i<n+1;i++)
    {
        ll mx=inf;
        for(int j=1;j<m+1;j++)
        {
            b[i][j]=min(b[i-1][j]+1,a[i][j]);
        }
        mx=b[i][1];

        for(int j=1;j<m+1;j++)
        {
            //cout<<mx<<" ";
            re=max(re,a[i][j]-1-mx);
            mx=min(mx,b[i][j]);
            mx++;
        }
    }
    cout<<re;

}

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