Codefroces 429 B. Working out
来源:互联网 发布:求最大公约数c语言 编辑:程序博客网 时间:2024/05/21 09:20
DP预处理出到4个顶点的最大距离,枚举相交的点
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 thei-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].
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=1100;int A[maxn][maxn],B[maxn][maxn],C[maxn][maxn],D[maxn][maxn];int a[maxn][maxn],n,m;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++) { A[i][j]=max(A[i-1][j],A[i][j-1])+a[i][j]; } } for(int i=1;i<=n;i++) { for(int j=m;j>0;j--) { B[i][j]=max(B[i-1][j],B[i][j+1])+a[i][j]; } } for(int i=n;i>0;i--) { for(int j=m;j>0;j--) { C[i][j]=max(C[i][j+1],C[i+1][j])+a[i][j]; } } for(int i=n;i>0;i--) { for(int j=1;j<=m;j++) { D[i][j]=max(D[i][j-1],D[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,A[i-1][j]+C[i+1][j]+B[i][j+1]+D[i][j-1]); ans=max(ans,A[i][j-1]+C[i][j+1]+B[i-1][j]+D[i+1][j]); } } printf("%d\n",ans); return 0;}
- Codefroces 429 B. Working out
- Codefroces 429 B. Working out
- Codeforces 429B Working out
- CodeForces 429B Working out
- codeforce 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构造
- cf 429B Working out dp
- Working out - CODEFORCES, 429B 动态规划
- Codeforce 题目429B Working out
- Codeforces 429B - Working out (DP)
- CF 429B. Working out DP
- 基础oracle_创建
- C#WinForms窗体无边框拖动
- ASP获取当前域名或者IP的方法
- Redis常用命令
- android下配置OpenVPN
- Codefroces 429 B. Working out
- goole map 根据地址获取经纬度
- Raw-OS源码分析之任务删除与总结
- Android架构分析之Android消息处理机制(一)
- c#连接Redis缓存数据库Redis的安装与配置
- 利用批处理(BAT)读取字符串空行判断及其他
- 如果有一天
- 为Python添加默认模块搜索路径
- declare-styleable中format详解