题目大意:两个人(假设为A,B),打算健身,有N行M列个房间,每个房间能消耗Map[i][j]的卡路里,A起点为(1,1)要达到(n,m)点,且每次只能向右走一步或向下走一步,B起点为(n,1),要达到(1,m),且每次只能向上走一步,或向右走一步。有要求A,B必须在某一个房间相遇一次,且A,B在该房间不再消耗卡路里,因为两人锻炼身体的速度不同,所以在相遇时经过的房间数亦可能不相同。问两人合计最多消耗多少卡路里。
题目思路:分别从四个角向对角打dp表,然后遍历各个点认为该点为相遇的房间,依据该点求四个dp式的和,并找出最大值,他们不可能在边缘相遇 那样肯定会走多个相同的格子
代码:
代码:
#define LL long long
#define INF 0x3f3f3f3f
#define maxn 1024
#define Pair pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define _ ios_base::sync_with_stdio(0),cin.tie(0)
using namespace std;
int dp1[maxn][maxn], dp2[maxn][maxn], dp3[maxn][maxn], dp4[maxn][maxn];
int edge[maxn][maxn];
int ans = 0;
int n, m;
int main()
{
_;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cin >> edge[i][j];
}
}
mem(dp1, 0), mem(dp2, 0), mem(dp3, 0), mem(dp4, 0);
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]) + edge[i][j];
}
}
for (int i = n; i >= 1; --i) {
for (int j = m; j >= 1; --j) {
dp2[i][j] = max(dp2[i + 1][j], dp2[i][j + 1]) + edge[i][j];
}
}
for (int i = n; i >= 1; --i) {
for (int j = 1; j <= m; ++j) {
dp3[i][j] = max(dp3[i + 1][j], dp3[i][j - 1]) + edge[i][j];
}
}
for (int i = 1; i <= n; ++i) {
for (int j = m; j >= 1; --j) {
dp4[i][j] = max(dp4[i - 1][j], dp4[i][j + 1]) + edge[i][j];
}
}
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]);
}
}
cout << ans << endl;
return 0;
}