Codeforces Round #245 (Div. 1) -- B. Working out （DP）

B. Working out

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

input

3 3
100 100 100
100 1 100
100 100 100

output

800

Note

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

大体题意：

一个人从左上角到右下角，只能向右或者向下走，另一个人从左下角到右上角，只能向右走或者向上走。他们会在某

一个点相遇，确切的就是只有一个点（虽然可能多解），工作过的点他们不会再走！

思路：

起点和终点加起来总共有四个，所以可以写4个DP[i][j]，表示i，j这个点到起点的最大值！

然后枚举相遇点，求出最大值！

特别说明一下，：因为是不走已经工作过的点，所以走相遇点只有两种方式，第一个人横着走过去，第二个人竖着走

过去，或者反过来！第一个人竖着走过去，第二个人横着走过去！

想一下知道  相遇点不可能在第一列 第一行 最后一列  最后一行，如果枚举 就错了 = =！

详细见代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
int a[maxn][maxn];
int dp1[maxn][maxn];
int dp2[maxn][maxn];
int dp3[maxn][maxn];
int dp4[maxn][maxn];
int main(){
    int n,m;
    scanf("%d %d",&n,&m);
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= m; ++j){
            scanf("%d",&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 = 1; i <= n; ++i){ // 右上角
        for (int j = m; j >= 1; --j){
            dp3[i][j] = max(dp3[i-1][j],dp3[i][j+1]) + a[i][j];
        }
    }
    for (int i = n; i >= 1; --i){ // 左下角
        for(int j = 1; j <= m; ++j){
            dp4[i][j] = max(dp4[i+1][j],dp4[i][j-1]) + a[i][j];
        }
    }
    int ans = 0;
    for (int i = 2; i < n; ++i){
        for (int j = 2; j < m; ++j){
            ans = max(ans,dp1[i-1][j] + dp2[i+1][j] + dp4[i][j-1] + dp3[i][j+1] );
            ans = max(ans,dp1[i][j-1] + dp2[i][j+1] + dp4[i+1][j] + dp3[i-1][j] );

        }

    }
    printf("%d\n",ans);
    return 0;
}