CodeForces - 429B Working out（递推）

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] ≤ 10⁵).

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 exercises   a[3][1] → a[2][1] → a[2][2] → a[2][3] → a[1][3].

题意：两人必须再一点相遇，并且相遇点不必加和，求A从左上角到右下角，B从左下角到右上角，所得的最大和。

思路：从四个角分别递推，最后对于某一点，要么A从上到下，B从左到右，要么A从左到右，B从上到下。两种情况判断，求最大和。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define INF 0x3f3f3f3f
#define IO ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
using namespace std;
int a[1010][1010], dp1[1010][1010], dp2[1010][1010], dp3[1010][1010], dp4[1010][1010];
int main()
{
	int n, m;
	cin >> n >> m;
	memset(dp1, 0, sizeof(dp1));
	memset(dp2, 0, sizeof(dp2));
	memset(dp3, 0, sizeof(dp3));
	memset(dp4, 0, sizeof(dp4));	
	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 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+1][j], dp3[i][j-1])+a[i][j];
		}
		for(int j = m; j >= 1; j--){
			dp4[i][j] = max(dp4[i+1][j], dp4[i][j+1])+a[i][j];
		}		
	}
	int maxm = -INF;
	for(int i = 2; i < n; i++){
		for(int j = 2; j < m; j++){
			int tmp1 = dp1[i-1][j]+dp4[i+1][j]+dp2[i][j+1]+dp3[i][j-1];
			int tmp2 = dp1[i][j-1]+dp4[i][j+1]+dp2[i-1][j]+dp3[i+1][j];
			maxm = max(maxm, tmp1);
			maxm = max(maxm, tmp2);
		} 
	}
	cout << maxm << endl;
	return 0;
}