Submission #3552295

---

Source Code Expand

#include<cstring>
#include<iostream>
#define int long long
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
int n,m,a[301][301],b[301][301],c[301][301],ans;
void work(){
	int res=-inf;
	memset(c,0xcf,sizeof(c));
	memset(b,0xcf,sizeof(b));
	for(int i=0;i<=n;i++)
	for(int j=0;j<m;j++)
	for(int k=j+1;k<=m;k++){
		res=max(res,c[j][k]-a[i][j]+a[i][k]);
		c[j][k]=max(c[j][k],a[i][j]-a[i][k]);
		ans=max(ans,b[j][k]-a[i][j]+a[i][k]);
		b[j][k]=max(b[j][k],res+a[i][j]-a[i][k]);
	}
}
signed main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++)
	cin>>a[i][j],a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
	ans=-inf;
	work();
	swap(n,m);
	for(int i=0;i<=300;i++)
	for(int j=i;j<=300;j++)
	swap(a[i][j],a[j][i]);
	work();
	cout<<ans<<endl;
}

Submission Info

Judge Result