Submission #96448

#	Time	Username	Problem	Language	Result	Execution time	Memory
96448		KLPP	Maxcomp (info1cup18_maxcomp)	C++14	100 / 100	459 ms	32376 KiB

maxcomp

#include<bits/stdc++.h>

using namespace std;
typedef long long int lld;
lld B[1000][1000];
lld minB[1000][1000];
int n,m;
lld abs(lld a){
	if(a>0)return a;
	return -a;
}
lld solve(){
	lld ans=-1;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			minB[i][j]=B[i][j];
			if(i>0)minB[i][j]=min(minB[i][j],minB[i-1][j]);
			if(j>0)minB[i][j]=min(minB[i][j],minB[i][j-1]);
			ans=max(ans,B[i][j]-minB[i][j]-1);
		}
	}
	return ans;
}
int main(){
	cin>>n>>m;
	lld matrix[n][m];
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cin>>matrix[i][j];
		}
	}
	
	lld ans=-1;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			B[i][j]=matrix[i][j]-i-j;
		}
	}
	ans=max(ans,solve());
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			B[i][j]=matrix[i][m-1-j]-i-j;
		}
	}
	ans=max(ans,solve());
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			B[i][j]=matrix[n-1-i][j]-i-j;
		}
	}
	ans=max(ans,solve());
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			B[i][j]=matrix[n-1-i][m-1-j]-i-j;
		}
	}
	ans=max(ans,solve());
	cout<<ans<<endl;
	return 0;
}

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