标签：
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].
题目链接：http://codeforces.com/problemset/problem/429/B
*********************************************************
题意： Iahub 和 Iahubina在一个矩阵健身房锻炼身体，Iahub从（1,1）出发，要到达（n,m）；Iahubina从（n,1）出发，要到达（1,m）；他们俩还必须要见上一面
解题思路：可以枚举每个可能相遇的点所产生的最大情况
dp1[i][j] 从（1,1）到（i,j）的最大值
dp2[i][j] 从（n,m）到（i,j）的最大值
dp3[i][j] 从（n,1）到（i,j）的最大值
dp1[i][j] 从（1,m）到（i,j）的最大值
ans为最终结果：
由于遍历的每个点是，可以分为四个部分
（1,1）->（i,j）+（i,j）->(n,m) + (n,1)->(i,j) + （1,m）->(i,j)
因此可以用ans更新四部分和的最大值
AC代码：
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <stack> #include <map> #include <vector> using namespace std; #define N 1200 #define INF 0x3f3f3f3f int maps[N][N],dp1[N][N],dp2[N][N],dp3[N][N],dp4[N][N]; int main() { int n,m,i,j; while(scanf("%d %d", &n,&m) != EOF) { memset(dp1,0,sizeof(dp1)); memset(dp2,0,sizeof(dp2)); memset(dp3,0,sizeof(dp3)); memset(dp4,0,sizeof(dp4)); memset(maps,0,sizeof(maps)); for(i=1; i<=n; i++) for(j=1; j<=m; j++) scanf("%d", &maps[i][j]); for(i=1; i<=n; i++)///(1,1)到(i,j)最大值 for(j=1; j<=m; j++) dp1[i][j]=max(dp1[i-1][j],dp1[i][j-1])+maps[i][j]; for(i=n; i>=1; i--)///(n,m)到(i,j)最大值 for(j=m; j>=1; j--) dp2[i][j]=max(dp2[i+1][j],dp2[i][j+1])+maps[i][j]; for(i=n; i>=1; i--)///(n,1)到(i,j)最大值 for(j=1; j<=m; j++) dp3[i][j]=max(dp3[i][j-1],dp3[i+1][j])+maps[i][j]; for(i=1; i<=n; i++)///(1,m)到(i,j)最大值 for(j=m; j>=1; j--) dp4[i][j]=max(dp4[i][j+1],dp4[i-1][j])+maps[i][j]; int ans=0; for(i=2; i<n; i++) for(j=2; j<m; j++) { ans=max(ans,dp1[i][j-1]+dp2[i][j+1]+dp3[i+1][j]+dp4[i-1][j]); ans=max(ans,dp1[i-1][j]+dp2[i+1][j]+dp3[i][j-1]+dp4[i][j+1]); }///（1,1）->（i,j）+（i,j）->(n,m) + (n,1)->(i,j) + （1,m）->(i,j) printf("%d\n", ans); } return 0; }
CodeForces 429 B B. Working out
标签：
原文地址：http://www.cnblogs.com/weiyuan/p/5773470.html
