CodeForces429B Working out

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].

从四个角求出到任意一点的最大数值，那么题中所需求解的最大值即为四段路径的数值之和，而之前的操作已经求出。

需要注意的是，两个人的路径不能有两个交点，这就限定了交点不在边界上，且四段路径只有两种可能。

还有一点是，不能够采用全到达交点的数值之和再减去该点数值的四倍的方式来计算，这可能会导致不符合只有一个交点的条件。

#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long LL;
int dp1[1005][1005],dp2[1005][1005],dp3[1005][1005],dp4[1005][1005];
int a[1005][1005];
int f(int i,int j)
{
    int res1=dp1[i-1][j]+dp2[i+1][j]+dp3[i][j-1]+dp4[i][j+1];
    int res2=dp1[i][j-1]+dp2[i][j+1]+dp3[i+1][j]+dp4[i-1][j];
    return max(res1,res2);
}
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("%d",&a[i][j]);
            }
        }
        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++){
                dp1[i][j]=max(dp1[i-1][j],dp1[i][j-1])+a[i][j];
            }
        }
        for(int i=n;i>0;i--){
            for(int j=m;j>0;j--){
                dp2[i][j]=max(dp2[i+1][j],dp2[i][j+1])+a[i][j];
            }
        }
        for(int i=n;i>0;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 i=1;i<=n;i++){
            for(int j=m;j>0;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,f(i,j));
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}