CodeForces 429B Working out
[题目链接] (http://codeforces.com/problemset/problem/429/B)
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].
题意:
两个人走n*m格子,要求一个人走左方和上方,一个人走右方和下方,要求两 个人最终在一个点相遇(只会相遇一次),且走遍整个格子,求最大收益
思路:
由于两个人最终会在一个点相遇,我们可以把整个过程进行逆过程,即
一个人从某一点出发,走遍整个格子,其收益最大(跟一笔画游有点像 哦
……(^__^) ……)所以先求从这个格子往四个角能获得的最大值,从4个角
往各个点DP即可。
注意:为保证只有一个格子相遇,枚举相遇格子后,更新的值应该是这个
代码如下:
#include <stdio.h>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define N 1005
__int64 n,m,a[N][N],dp1[N][N],dp2[N][N],dp3[N][N],dp4[N][N];
__int64 ans,sum;
int main()
{
int i,j;
while(~scanf("%I64d%I64d",&n,&m))
{
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%I64d",&a[i][j]);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
dp1[i][j]=a[i][j];
dp1[i][j]+=max(dp1[i-1][j],dp1[i][j-1]); //左 上
}
for(i=1;i<=n;i++)
for(j=m;j>0;j--)
{
dp2[i][j]=a[i][j];
dp2[i][j]+=max(dp2[i-1][j],dp2[i][j+1]); //右 上
}
for(i=n;i>0;i--)
for(j=m;j>0;j--)
{
dp3[i][j]=a[i][j];
dp3[i][j]+=max(dp3[i+1][j],dp3[i][j+1]); // 右 下
}
for(i=n;i>0;i--)
for(j=1;j<=m;j++)
{
dp4[i][j]=a[i][j];
dp4[i][j]+=max(dp4[i+1][j],dp4[i][j-1]); // 左 下
}
ans=0;
for(i=2;i<n;i++)
for(j=2;j<m;j++)
{
sum=dp1[i-1][j]+dp3[i+1][j]+dp2[i][j+1]+dp4[i][j-1];
ans=max(ans,sum);
sum=dp1[i][j-1]+dp3[i][j+1]+dp2[i-1][j]+dp4[i+1][j];
ans=max(ans,sum);
}
printf("%I64d\n",ans);
}
return 0;
}