B. Working out
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
3 3
100 100 100
100 1 100
100 100 100
output
800
首先对四个角遍历一遍。dp[ k ][ i ][ j ]表示从第k个角出发,到达点(i,j),此时得到的最大的和。
要使结果最大,因此相遇的点只能有一个。
该相遇点便将两条路分成了4段,遍历相遇点,求出4段路上的最大和即可。
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=1005;
ll a[maxn][maxn];
ll dp[5][maxn][maxn];
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%I64d",&a[i][j]);
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
dp[0][i][j]=max(dp[0][i-1][j],dp[0][i][j-1])+a[i][j];
for(int j=m;j>=1;j--)
dp[2][i][j]=max(dp[2][i-1][j],dp[2][i][j+1])+a[i][j];
}
for(int i=n;i>=1;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=0;i<=n+1;i++)
for(int k=0;k<=3;k++)
dp[k][i][0]=dp[k][i][m+1]=-INF;
for(int j=0;j<=m+1;j++)
for(int k=0;k<=3;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 cnt=dp[0][i][j-1]+dp[3][i][j+1]+dp[1][i+1][j]+dp[2][i-1][j];
ans=max(ans,cnt);
cnt=dp[0][i-1][j]+dp[3][i+1][j]+dp[1][i][j-1]+dp[2][i][j+1];
ans=max(ans,cnt);
}
cout<<ans<<endl;
}
return 0;
}