Submission #1864935

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF 1e16

ll h,w;
ll b[303][303],c[303][303];
ll sum[303][303];
ll l[303],r[303];

ll solve(){
  rep(i,h)rep(j,w){
    sum[i+1][j+1]=b[i][j];
  }
  rep(i,h+1)rep(j,w)sum[i][j+1]+=sum[i][j];
  rep(i,h)rep(j,w+1)sum[i+1][j]+=sum[i][j];

  rep(i,w+1)l[i]=-INF;
  l[0]=0;
  rep(lb,h)repl(ub,lb,h){
    vector<ll> a;
    rep(j,w)a.push_back(sum[ub+1][j+1]-sum[ub+1][j]-sum[lb][j+1]+sum[lb][j]);
    ll s=0;
    rep(j,w){
      s+=a[j];
      if(s<a[j])s=a[j];
      maxch(l[j+1],s);
    }
  }
  repl(i,1,w)maxch(l[i+1],l[i]);

  rep(i,w+1)r[i]=-INF;
  r[0]=0;
  rep(lb,h)repl(ub,lb,h){
    vector<ll> a;
    rep(j,w)a.push_back(sum[ub+1][w-j]-sum[ub+1][w-j-1]-sum[lb][w-j]+sum[lb][w-j-1]);
    ll s=0;
    rep(j,w){
      s+=a[j];
      if(s<a[j])s=a[j];
      maxch(r[j+1],s);
    }
  }
  repl(j,1,w)maxch(r[j+1],r[j]);

  ll res=-INF;
  repl(j,1,w)maxch(res,l[j]+r[w-j]);

  return res;
}

int main(){
	cin>>h>>w;
  rep(i,h)rep(j,w)cin>>b[i][j];
  ll resa=solve();
  rep(i,h)rep(j,w)c[j][i]=b[i][j];
  memcpy(b,c,sizeof(c));
  swap(h,w);
  ll resb=solve();
  cout<<max(resa,resb)<<endl;
	return 0;
}

Submission Info

Judge Result