Working out - CODEFORCES, 429B 动态规划
来源:互联网 发布:沈阳培训 盘古网络 编辑:程序博客网 时间:2024/05/08 11:09
题目链接 CODEFORCES 429B
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.
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).
The output contains a single number — the maximum total gain possible.
3 3100 100 100100 1 100100 100 100
800
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].
解题思路:先预处理出从四个顶点出发到任一点的最大值,用dp即可。然后 枚举相遇点,相遇点不可能在边缘,因为那样交点就肯定不止一个,对于每个交点有两种方式走,
求出两种方式最大值就可。
代码
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define maxn 1000+10int dp1[maxn][maxn]={0};int dp2[maxn][maxn]={0};int dp3[maxn][maxn]={0};int dp4[maxn][maxn]={0};int a[maxn][maxn];int m,n;int main(){ scanf("%d %d",&n,&m); for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ scanf("%d",&a[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]) + a[i][j]; } } for(int i=n;i>=1;i--){ for(int j=m;j>=1;j--){ dp2[i][j] = max(dp2[i][j+1],dp2[i+1][j]) + a[i][j]; } } for(int i=n;i>=1;i--){ for(int j=1;j<=m;j++){ dp3[i][j] = max(dp3[i][j-1],dp3[i+1][j]) + a[i][j]; } } for(int i=1;i<=n;i++){ for(int j=m;j>=1;j--){ dp4[i][j] = max(dp4[i][j+1],dp4[i-1][j]) + a[i][j]; } } int ans = 0; for(int i=2;i<n;i++){ for(int 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]); } } printf("%d\n",ans); return 0;}
- Working out - CODEFORCES, 429B 动态规划
- Codeforces 429B Working out (动态规划)
- Codeforces 429B Working out (动态规划) -- 解题报告
- [dp] Codeforces 429B B. Working out(动态规划(DP))
- Codeforces 429B Working out
- CodeForces 429B Working out
- CodeForces 429B Working out
- [dp] Codeforces 429B B. Working out
- codeforces 429B B. Working out(dp)
- dp Codeforces 429B B. Working out
- Codeforces 429B B. Working out dp
- CodeForces 429B B.Working out
- Codeforces 429B B. Working out
- Codeforces 429B Working out bfs构造
- Codeforces 429B - Working out (DP)
- CodeForces - 429B Working out(dp)
- CodeForces 429B Working out 递推
- [题解] CodeForces 429B Working out
- mysql安装图解 mysql图文安装教程(详细说明) 5.0版本
- 运行servlet时出现404错误
- 让Nginx处理Django的静态文件
- java基础增强---反射
- unknown command-line argument or argument value build错误
- Working out - CODEFORCES, 429B 动态规划
- Java面向对象的理解3
- GoogleVis包生成的网页没有图像的解决办法
- 机器学习算法-Adaboost
- CentOS+nginx+Django+Postgresql web环境搭建
- 黑马程序员——类和对象
- Matlab优化问题03—fminsearch
- ROS学习手记 - 2 Create and Build ROS Package 生成包(C++)
- 日志三:GUI事件处理