Working out _四角dp

原创 2018年04月15日 17:35:31

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


#include<bits/stdc++.h>
#include<cstring>
#include<vector>
#include<algorithm>
#include<iostream>

using namespace std;

const int N=1e3+10;

#define ll long long
#define rep(i,n) for(int i=1;i<=n;i++)
#define red(i,n) for(int i=n;i>=1;i--)

ll ans=0,a[N][N],dp[4][N][N];

int n,m;
int main(){
    //freopen("in.txt","r",stdin);
    cin>>n>>m;
    rep(i,n)rep(j,m)
    scanf("%lld",&a[i][j]);
    rep(i,n)rep(j,m)dp[1][i][j]=a[i][j]+max(dp[1][i-1][j],dp[1][i][j-1]);
    red(i,n)red(j,m)dp[2][i][j]=a[i][j]+max(dp[2][i+1][j],dp[2][i][j+1]);
    red(i,n)rep(j,m)dp[3][i][j]=a[i][j]+max(dp[3][i+1][j],dp[3][i][j-1]);
    rep(i,n)red(j,m)dp[0][i][j]=a[i][j]+max(dp[0][i-1][j],dp[0][i][j+1]);
    ll ans=0;
    for(int i=2;i<n;i++)
    for(int j=2;j<m;j++){
        ans=max(ans,dp[1][i-1][j]+dp[2][i+1][j]+dp[3][i][j-1]+dp[0][i][j+1]);
        ans=max(ans,dp[1][i][j-1]+dp[2][i][j+1]+dp[3][i+1][j]+dp[0][i-1][j]);
    }
    cout<<ans<<endl;
//    fclose(stdin);
}



版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ujn20161222/article/details/79951144

Unity视角旋转/摄像机围绕人物旋转

Unity视角旋转/摄像机围绕人物旋转
  • 2016年12月16日 14:27

codeforces 429B B. Working out(dp)

题目链接:codeforces 429B题目大意:给出一个矩阵,一个人从左上角走到右下角,一个人从左下角走到右上角,两个人只会在一个点相交,问两个人经过路径上的数的和最大的情况下最大和是多少。题目分析...
  • qq_24451605
  • qq_24451605
  • 2015-09-16 21:25:58
  • 1437

Codeforces 430D Working out【dp】好题~

D. Working out time limit per test 2 seconds memory limit per test 256 megabytes input standard i...
  • mengxiang000000
  • mengxiang000000
  • 2017-01-01 16:26:56
  • 271

codeforces 429B B. Working out 详解(dp)

D. Working out time limit per test 2 seconds memory limit per test 256 megabytes input standard i...
  • qq_34374664
  • qq_34374664
  • 2017-01-16 22:27:41
  • 667

dp Codeforces 429B B. Working out

B. Working out time limit per test  2 seconds memory limit per test  256 megabytes ...
  • liuyanfeier
  • liuyanfeier
  • 2016-01-19 17:10:35
  • 261

Codeforces 429B B. Working out (DP)

传送门:B. Working out B. Working out time limit per test 2 seconds memory limit per test 256 mega...
  • guhaiteng
  • guhaiteng
  • 2016-08-28 17:00:34
  • 319

codeforces429B Working out (DP)

题目链接:戳这里 题目大意:有一个n*m的矩形,一个人从(1,1)出发,只能向下或向右走到(n,m),另一人从(n,1)出发,只能向上或向右走到(1,m),两人的路径最多只能有1个交点,且交点的值不...
  • qq_39791208
  • qq_39791208
  • 2017-12-27 09:03:58
  • 67

CodeForces 429B Working out // 递推dp

题目描述CodeForces 429B Working out解题思路题目大意: 有n*m个格子, 走过一个格子可以得到相应的分数. A 从(1,1)开始沿 下 或 右 走到(n,m) B 从(...
  • xmzyt1996
  • xmzyt1996
  • 2015-08-12 21:54:48
  • 755

CodeForces 429B Working out(dp,四个角递推)

B. Working out Summer is coming! It's time for Iahub and Iahubina to work out, as they both w...
  • Code_KK
  • Code_KK
  • 2015-10-13 19:35:25
  • 1004

Working out(详解)

Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the...
  • m0_37579232
  • m0_37579232
  • 2018-02-24 22:06:45
  • 55
收藏助手
不良信息举报
您举报文章:Working out _四角dp
举报原因:
原因补充:

(最多只允许输入30个字)