#include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i=x;i--) #define fore(i,a) for(auto& i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using ll = long long; using ld = long double; template using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}} #define retval(x) {cout << #x << endl; return;} #define cout2(x,y) cout << x << " " << y << endl; #define coutp(p) cout << p.fi << " " << p.se << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outdv fore(yans , ans) cout << yans.val() << "\n"; #define assertmle(x) if (!(x)) {vi v(3e8);} #define asserttle(x) if (!(x)) {while(1){}} #define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define coutv2(v) fore(vy , v) cout << vy << "\n"; #define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define coutvm2(v) fore(vy , v) cout << vy.val() << "\n"; using pll = pair;using pil = pair;using pli = pair;using pii = pair;using pdd = pair; using vi = vector;using vd = vector;using vl = vector;using vs = vector;using vb = vector; using vpii = vector;using vpli = vector;using vpll = vector;using vpil = vector; using vvi = vector>;using vvl = vector>;using vvs = vector>;using vvb = vector>; using vvpii = vector>;using vvpli = vector>;using vvpll = vector;using vvpil = vector; using mint = modint998244353; //using mint = modint1000000007; //using mint = dynamic_modint<0>; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"<>h>>w; vvl a(h,vl(w)); rep(i,h) rep(j,w) cin>>a[i][j]; ll ans = 0; vpii v; repx(i,-1,h+1) v.pb({i,-1}); repx(i,-1,h+1) v.pb({i,w}); repx(i,0,w) v.pb({-1,i}); repx(i,0,w) v.pb({h,i}); vl sumh(h); vl sumw(w); rep(i,h) rep(j,w) sumh[i] += a[i][j]; rep(i,w) rep(j,h) sumw[i] += a[j][i]; rep(i,h) repx(i2,i+1,h) chmax(ans, sumh[i]+sumh[i2]); rep(i,w) repx(i2,i+1,w) chmax(ans, sumw[i]+sumw[i2]); rep(i,h) rep(j,w) chmax(ans, sumh[i]+sumw[j]-a[i][j]); vvi b(h,vi(w)); fore(p , v){ fore(q, v){ if (p == q) continue; if (p > q) continue; vpii vp = {p, q}; rep(kp,8) rep(kq,8){ if (kp<=3 && kq<=3) continue; vi dv = {kp, kq}; ll tmp = 0; rep(ii,2) rep1(jj,max(h,w)+1){ int x,y; x = vp[ii].fi + dx[dv[ii]]*jj; y = vp[ii].se + dy[dv[ii]]*jj; if (x <= h-1 && x >= 0 && y <= w-1 && y >= 0){ if (b[x][y]==1) continue; b[x][y] = 1; tmp += a[x][y]; }else{ break; } } rep(ii,2) rep1(jj,max(h,w)+1){ int x,y; x = vp[ii].fi + dx[dv[ii]]*jj; y = vp[ii].se + dy[dv[ii]]*jj; if (x <= h-1 && x >= 0 && y <= w-1 && y >= 0){ b[x][y] = 0; }else{ break; } } chmax(ans, tmp); } } } out; return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int t = 1; //cin>>t; rep(i,t){ solve(); } return 0; }