# Codeforces 429B B. Working out （DP）

###### 传送门：B. 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] ≤ 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].

n,m<=1000

dp.

###### 代码：

#include <bits/stdc++.h>
#define Memset(x, a) memset(x, a, sizeof(x))
#define ll __int64
using  namespace  std;

const int inf=0x3f3f3f3f;
const int N=1010;

ll  dp[5][N][N];
ll a[N][N];

int  main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);

int n,m;
while(cin>>n>>m){
Memset(a, 0);
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
cin>>a[i][j];
Memset(dp, 0);
for(int i=1; i<=n; i++){
for(int j=1; j<=m; j++)
dp[1][i][j]=max(dp[1][i-1][j], dp[1][i][j-1])+a[i][j];
for(int j=m; j>=1; j--)
dp[3][i][j]=max(dp[3][i-1][j], dp[3][i][j+1])+a[i][j];
}
for(int i=n; i>=1; i--){
for(int j=1; j<=m; j++)
dp[2][i][j]=max(dp[2][i+1][j], dp[2][i][j-1])+a[i][j];
for(int j=m; j>=1; j--)
dp[4][i][j]=max(dp[4][i+1][j], dp[4][i][j+1])+a[i][j];
}
for(int i=0; i<=n+1; i++)    //把四个边界都置为无效情况
for(int k=1; k<=4; k++)
dp[k][i][0]=dp[k][i][m+1]=-inf;
for(int j=0; j<=m+1; j++)
for(int k=1; k<=4; k++)
dp[k][0][j]=dp[k][n+1][j]=-inf;
ll ans=0;
for(int i=1; i<=n; i++){
for(int j=1; j<=m; j++){
//只用考虑两种情况 两个人只能交叉一个格子，多了的话不合算
ll tmp=dp[1][i][j-1]+dp[4][i][j+1]+dp[2][i+1][j]+dp[3][i-1][j];
ans=max(ans, tmp);
tmp=dp[1][i-1][j]+dp[4][i+1][j]+dp[2][i][j-1]+dp[3][i][j+1];
ans=max(ans, tmp);
}
}
cout<<ans<<endl;
}
return 0;
}


• 本文已收录于以下专栏：

## dp Codeforces 429B B. Working out

B. Working out time limit per test  2 seconds memory limit per test  256 megabytes ...

## Codeforces 429B Working out (动态规划)

A - Working out Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Submi...
• CJL2313
• 2016年10月13日 14:38
• 195

## Working out （CodeForces - 429B ）

Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the...

## CodeForces 429B Working out 递推

B. Working out time limit per test 2 seconds memory limit per test 256 megabytes in...

## CodeForces 429B Working out

CodeForces 429B Working out[题目链接] (http://codeforces.com/problemset/problem/429/B)DescriptionSummer ...

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

B. Working out time limit per test 2 seconds memory limit per test 256 megabytes in...

举报原因： 您举报文章：Codeforces 429B B. Working out （DP） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)