Codeforces 429B B. Working out (DP)

原创 2016年08月28日 17:00:34
传送门: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的矩阵,每个格子有个数,A从(1,1)出发只能向下或右走,终点为(n,m),B从(n,1)出发只能向上或右走,终点为(1,m)。两个人的速度不一样,走到的格子可以获的该格子的数,两人相遇的格子上的数两个人都不能拿。求A和B能拿到的数的总和的最大值。

n,m<=1000

思路:

dp.

先预处理出每个格子到四个角落格子的路径最大数值,然后枚举两个人相遇的交点格子,枚举A、B的进来和出去方式,求最大值即可。

注意边界情况。处理的时候细心点,还得耐心点。

代码:

#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;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

codeforces 429B B. Working out(dp)

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

B - Working out CodeForces - 429B (dp)

题意: 给出n*m个格子,每个格子都有一定的分数,走过这个格子可以获得分数。 A 从(1,1)沿 下 或 右 走到(n,m) B 从(n,1)沿 上 或 右 走到(1,m) 两人路径有且只...

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
  • 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 429B Working out (动态规划) -- 解题报告

题目链接题目大意两个人在一个有 n×m 个房间的健身房内健身,每个房间都有一个锻炼可消耗的卡路里数。一个人从 a[1][1] 一路锻炼到 a[n][m] ,每次只能从 a[i][j] 移动到 a[i+...

CF 429B. Working out DP

原题见CF 429B给一个n*m的方格,A从左上角走到右下角,B从左下角走到右上角,路线交叉处的权值不算,问两条路线权值之和最大值。要求:两条路线只在一点交叉。分析可以枚举交叉点,求该点到四个角落的权...

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个字)