Working out(CodeForces 429B，dp)

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 the i-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 workout a[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] ≤ 105).

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

Hint

Iahub will choose exercises a[1][1] → a[1][2] → a[2][2] → a[3][2] → a[3][3]. Iahubina will choose exercises a[3][1] → a[2][1] → a[2][2] → a[2][3] → a[1][3].

题解：

共有两个人，一个人A要求从（1， 1）走到（n,  n）（只能向右或向下），另一个人B要求从（n,  1）走到（1，n）（只能向右或向上）。相遇时的格子的数值不算（只能相遇一个格子），问你两个人当都到达要求时的地点，最大数值为多少？先列举一个相遇时的格子，那么共有两种情况。（一种一个人从相遇点的左边过来，另一个人从相遇点的下面过来；另一种一个人从相遇点的上面过来，另一个人从相遇点的 右边过来）如图所示。

dp1[i][j] := 从 (1, 1) 到 (i, j) 的最大分数 
dp2[i][j] := 从 (i, j) 到 (n, m) 的最大分数 
dp3[i][j] := 从 (n, 1) 到 (i, j) 的最大分数 
dp4[i][j] := 从 (i, j) 到 (1, m) 的最大分数

求出每个相遇点到四个角的最大值，每个点分别在两种情形下四个dp相加的最大值即为所求。

  

注意：相遇点不可能在边缘，因为那样交点就肯定不止一个（自己想一想）。

代码如下：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<algorithm>
#define max(a,b)   (a>b?a:b)
#define min(a,b)   (a<b?a:b)
#define swap(a,b)  (a=a+b,b=a-b,a=a-b)
#define maxn 1007
#define N 100000000
#define INF 0x3f3f3f3f
#define mod 1000000009
#define e  2.718281828459045
#define eps 1.0e18
#define PI acos(-1)
#define lowbit(x) (x&(-x))
#define read(x) scanf("%d",&x)
#define put(x) printf("%d\n",x)
#define memset(x,y) memset(x,y,sizeof(x))
#define Debug(x) cout<<x<<" "<<endl
#define lson i << 1,l,m
#define rson i << 1 | 1,m + 1,r
#define ll long long
//std::ios::sync_with_stdio(false);
//cin.tie(NULL);
using namespace std;

int dp1[maxn][maxn],dp2[maxn][maxn],dp3[maxn][maxn],dp4[maxn][maxn];
int a[maxn][maxn];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            cin>>a[i][j];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            dp1[i][j]=max(dp1[i-1][j],dp1[i][j-1])+a[i][j];
    for(int i=n;i>=1;i--)
        for(int j=m;j>=1;j--)
            dp2[i][j]=max(dp2[i+1][j],dp2[i][j+1])+a[i][j];
    for(int i=n;i>=1;i--)
        for(int j=1;j<=m;j++)
            dp3[i][j]=max(dp3[i][j-1],dp3[i+1][j])+a[i][j];
    for(int i=1;i<=n;i++)
        for(int j=m;j>=1;j--)
            dp4[i][j]=max(dp4[i][j+1],dp4[i-1][j])+a[i][j];
    int maxx=0;
    for(int i=2; i<n; i++)
        for(int j=2; j<m; j++)
        {
            maxx=max(maxx,dp1[i][j-1]+dp2[i][j+1]+dp3[i+1][j]+dp4[i-1][j]);
            maxx=max(maxx,dp1[i-1][j]+dp2[i+1][j]+dp3[i][j-1]+dp4[i][j+1]);
        }
    cout<<maxx<<endl;
    return 0;
}