2022.12.9-CodeForces429B-Working out

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.

Examples

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]. 

题意描述：

给定一个 n 行 m 列的矩阵 A，在该矩阵中找出两条路径，要求：

• 第一条路径从矩阵左上角 (1, 1) 走到矩阵右下角 (n, m)，每次只能向下或向右走。
• 第二条路径从矩阵左下角 (n, 1) 走到矩阵右上角 (1, m)，每次只能向上或向右走。
• 两条路径有且仅有一个交点。

找出两条路径，在满足上述要求的情况下，使得路径经过的点除交点外的权值之和尽量大，输出这一最大值。

思路：

首先我们模拟一个假设该路线就是最优解如下图

这样我们去写这道题按正常的思路，更新和 这样算到的可以证明的是我们最后的总和满足和的最大权值和，但是无法保证去掉一个交点的权值和是最大的，所以我们只能选择从更优的解决方案，即：左上角到交点，右上角到交点，右下角到交点，左下角到交点这样算到的值才是最优的如下图

 

 最后的答案我们可以看到上下左右，但上既可能是从左上角来的也可能是从右上角来的所以要分别更新。

AcCode:

#include <bits/stdc++.h>
#define int long long
#define _vector_(x,n,m) vector<vector<int>>x(n,vector<int>(m))
using namespace std;
signed main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m;
  cin >> n >> m;
  _vector_ (a, n, m);
  for(int i = 0; i < n; i++)
    for(int j = 0; j < m; j++)
      cin >> a[i][j];
  _vector_ (dp1, n, m);
  dp1[0][0] = a[0][0];
  for(int i = 0; i < n; i++)for(int j = 0; j < m; j++){
      if(i > 0) dp1[i][j] = max(dp1[i - 1][j] + a[i][j], dp1[i][j]);
      if(j > 0) dp1[i][j] = max(dp1[i][j - 1] + a[i][j], dp1[i][j]);
    }
  _vector_ (dp2, n, m);
  dp2[n - 1][0] = a[n - 1][0];
  for(int i = n - 1; i >= 0; i--)for(int j = 0; j < m; j++){
      if(i + 1 < n) dp2[i][j] = max(dp2[i + 1][j] + a[i][j], dp2[i][j]);
      if(j > 0) dp2[i][j] = max(dp2[i][j - 1] + a[i][j], dp2[i][j]);
    }
  _vector_ (dp3, n, m);
  dp3[n - 1][m - 1] = a[n - 1][m - 1];
  for(int i = n - 1; i >= 0; i--)for(int j = m - 1; j >= 0; j--){
      if(i + 1 < n) dp3[i][j] = max(dp3[i + 1][j] + a[i][j], dp3[i][j]);
      if(j + 1 < m) dp3[i][j] = max(dp3[i][j + 1] + a[i][j], dp3[i][j]);
    }
  _vector_ (dp4, n, m);
  dp4[0][m - 1] = a[0][m - 1];
  for(int i = 0; i < n; i++)for(int j = m - 1; j >= 0; j--){
      if(i > 0) dp4[i][j] = max(dp4[i - 1][j] + a[i][j], dp4[i][j]);
      if(j + 1 < m) dp4[i][j] = max(dp4[i][j + 1] + a[i][j], dp4[i][j]);
    }
  int ans = 0;
  for(int i = 1; i + 1 < n; i++) for(int j = 1; j + 1 < m; j++)
  ans = max(max(ans, dp1[i][j - 1] + dp2[i + 1][j] + dp3[i][j + 1] + dp4[i - 1][j]), dp1[i - 1][j] + dp2[i][j - 1] + dp3[i + 1][j] + dp4[i][j + 1]);
  cout << ans << "\n";
  return 0;
}