Codeforces 429B B. Working out 2018-1-30
2018-01-30 13:49
381 查看
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
[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
[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 test(s)
input
output
Note
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].
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
[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
[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 test(s)
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 exercises a[3][1] → a[2][1] → a[2][2] → a[2][3] → a[1][3].
# include <cstdio> # include <cstdlib> # include <cmath> # include <cstring> # include <string> # include <iostream> # include <iomanip> # include <algorithm> # include <stack> # include <vector> # include <queue> using namespace std; long long a[1005][1005], dp[5][1005][1005]; int main() { int n, m; scanf("%d%d", &n, &m); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) scanf("%lld", &a[i][j]); memset(dp, 0, sizeof(dp)); 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]; } long long sum = 0; for (int i = 2; i<n; i++) for (int j = 2; j<m; j++) { sum = max(sum, dp[1][i - 1][j] + dp[4][i + 1][j] + dp[2][i][j - 1] + dp[3][i][j + 1]); sum = max(sum, dp[1][i][j - 1] + dp[4][i][j + 1] + dp[2][i + 1][j] + dp[3][i - 1][j]); } printf("%lld\n", sum); return 0; }
相关文章推荐
- Working out (CodeForces - 429B )
- Codeforces - Working out-429B - 动态规划/数塔变形
- [dp] Codeforces 429B B. Working out(动态规划(DP))
- codeforces 429B B. Working out 详解(dp)
- Codeforces 429B B. Working out (DP)
- 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
- Codeforces 429B B. Working out
- Codeforces-429-2-A Generous Kefa
- Codeforces-429-2-B Godsend
- Working out - CODEFORCES, 429B 动态规划
- Codeforces-429-2-C Leha and Function
- Codeforces 429B B. Working out dp
- Codeforces 429 A. Generous Kefa
- Codeforces 429 A. Xor-tree
- [dp] Codeforces 429B B. Working out
- Codeforces 429 A. Xor-tree