B. Working out----暴力dp

最新推荐文章于 2019-06-12 21:01:37 发布

原创最新推荐文章于 2019-06-12 21:01:37 发布 · 591 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

ACM_cf 同时被 3 个专栏收录

99 篇文章

订阅专栏

ACM_比赛

72 篇文章

订阅专栏

ACM_各种DP

37 篇文章

订阅专栏

本文介绍了一个涉及两人在矩阵中寻找最优路径的问题，旨在通过动态规划方法找到两人路径上能获得的最大值之和，同时确保他们在某一点相遇。

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

题目链接：http://codeforces.com/problemset/problem/429/B

题目的意思是说有两个人，第一个人从1,1出发，要到n，m去，另一个人从n，1出发，要到1，m去，然后让你求两个人路径经过的最大值加和，并且两个人要碰面一次，且只能碰面一次，求最大值。

我们可以很容易的想到在边界见面不可以，然后，因为这样会碰面两次，然后我们从四个角开始dp，然后暴力每一个点即可。

(1,1)->(i,j)+(i,j)->(n,m)+(n,1)->(i,j)+(i,j)->(1,m);

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int dp1[1010][1010],dp2[1010][1010],dp3[1010][1010],dp4[1010][1010];
int ans[1010][1010];
//(1,1)->(i,j)+(i,j)->(n,m)+(n,1)->(i,j)+(i,j)->(1,m);
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",&ans[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])+ans[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])+ans[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])+ans[i][j];
        }
    }
    for(int i=n;i>=1;i--){
        for(int j=1;j<=m;j++){
            dp4[i][j]=max(dp4[i][j-1],dp4[i+1][j])+ans[i][j];
        }
    }
    int cnt=0;
    for(int i=2;i<n;i++){
        for(int j=2;j<m;j++){
            cnt=max(cnt,dp1[i-1][j]+dp2[i+1][j]+dp3[i][j+1]+dp4[i][j-1]);
            cnt=max(cnt,dp1[i][j-1]+dp2[i][j+1]+dp3[i-1][j]+dp4[i+1][j]);
        }
    }
    printf("%d\n",cnt);
    return 0;
}