A - Working out

Description

Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and m columns. Let number a[i][j] represents the calories burned by performing workout at the cell of gym in thei-th line and the j-th column.

Iahub starts with workout located at line 1 and column 1. He needs to finish with workout a[n][m]. After finishing workout a[i][j], he can go to workout a[i + 1][j] or a[i][j + 1]. Similarly, Iahubina starts with workout a[n][1] and she needs to finish with workouta[1][m]. After finishing workout from cell a[i][j], she goes to either a[i][j + 1] or a[i - 1][j].

There is one additional condition for their training. They have to meet in exactly one cell of gym. At that cell, none of them will work out. They will talk about fast exponentiation (pretty odd small talk) and then both of them will move to the next workout.

If a workout was done by either Iahub or Iahubina, it counts as total gain. Please plan a workout for Iahub and Iahubina such as total gain to be as big as possible. Note, that Iahub and Iahubina can perform workouts with different speed, so the number of cells that they use to reach meet cell may differs.

Input

The first line of the input contains two integers n and m (3 ≤ n, m ≤ 1000). Each of the next n lines contains m integers: j-th number from i-th line denotes element a[i][j] (0 ≤ a[i][j] ≤ 10⁵).

Output

The output contains a single number — the maximum total gain possible.

Sample Input

Input

3 3
100 100 100
100 1 100
100 100 100

Output

800

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
int a[1002][1002]={0};
int pos1[1002][1003];
int pos2[1002][1003];
int pos3[1002][1003];
int pos4[1002][1003];
long long ans;
long long max2(long long a,long long b)
{  if(a>b)
  return a;
  else
    return b;


}
int main()
{  //int i,j;
   int m,n;
     //printf("%d",pos2[0][3]);
      cin>>m>>n;
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
          scanf("%d",&a[i][j]);
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
       pos1[i][j]=max(pos1[i-1][j],pos1[i][j-1])+a[i][j];//左上角的dp矩阵
       for(int i=1;i<=m;i++)
         for(int j=n;j>=1;j--)
         pos2[i][j]=max(pos2[i][j+1],pos2[i-1][j])+a[i][j];//右上角的dp函数
       for(int i=m;i>=1;i--)
        for(int j=1;j<=n;j++)
         pos3[i][j]=max(pos3[i+1][j],pos3[i][j-1])+a[i][j];//左下角的dp函数
       for(int i=m;i>=1;i--)
        for(int j=n;j>=1;j--)
         pos4[i][j]=max(pos4[i+1][j],pos4[i][j+1])+a[i][j];//右下角的dp函数
          ans=0;
       for(int i=2;i<m;i++)
        for(int j=2;j<n;j++)
         {ans=max2(ans,pos1[i-1][j]+pos2[i][j+1]+pos3[i][j-1]+pos4[i+1][j]);
            ans=max2(ans,pos1[i][j-1]+pos2[i-1][j]+pos3[i+1][j]+pos4[i][j+1]);
            //对每个相交点进行枚举，对每个相交点来说不取值，所以舍掉了他的a[i][j],
            //如果需要就加上就行
         }
         printf("%d\n",ans);
      /*for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
      {printf("%d  ",pos1[i][j]);//测试工作，理解了这几个数组的功用
      printf("%d  ",pos2[i][j]);
      printf("%d ",pos3[i][j]);
      printf("%d\n",pos4[i][j]);}*/
      /*for(int i=2;i<m;i++)
      for(int j=2;j<n;j++)
         {
             int l=pos1[i-1][j]+pos2[i][j+1]+pos3[i][j-1]+pos4[i+1][j];
             int d=pos1[i][j-1]+pos2[i-1][j]+pos3[i+1][j]+pos4[i][j+1];
             printf("%d   ",l);
            printf("%d\n",d);


         }*/




    //cout << "Hello world!" << endl;
    return 0;
}