Think:
1知识点:dp/二分+暴力
2题意:从(1, 1)点到达(n, m)点,每经过一个点可能会失去能量或者得到能量,询问最小的出发能量使得存在一条路径,路径经过每一点时能量值大于0,已知出发点(1, 1)和终点(n, m)点可获得或者会失去能量为零
3思路:
1>dp:
状态转移方程:
(1)i == n && j == m:dp[i][j] = 1;
else (2)i = n: dp[i][j] = dp[i][j+1] - a[i][j];
else (3)j = m:dp[i][j] = dp[i+1][j] - a[i][j];
else (4)i != n && j != m:dp[i][j] = max(1, min(dp[i][j+1]-a[i][j], dp[i+1][j]-a[i][j]));
2>二分+暴力:
已知每个点可失去的能量值小于等于1e3,n和m小于等于500,因此最大初始能量小于等于1e3*(500+500-1)
以下为Accepted代码——方法一
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 514;
int a[N][N], dp[N][N];
int main(){
int T, n, m, i, j;
scanf("%d", &T);
while(T--){
scanf("%d %d", &n, &m);
for(i = 1; i <= n; i++){
for(j = 1; j <= m; j++){
scanf("%d", &a[i][j]);
}
}
dp[n][m] = 1;
for(i = m-1; i >= 1; i--)
dp[n][i] = max(1, dp[n][i+1]-a[n][i]);
for(i = n-1; i >= 1; i--)
dp[i][m] = max(1, dp[i+1][m]-a[i][m]);
for(i = n-1; i >= 1; i--){
for(j = m-1; j >= 1; j--){
dp[i][j] = max(1, min(dp[i+1][j]-a[i][j], dp[i][j+1]-a[i][j]));
}
}
printf("%d\n", dp[1][1]);
}
return 0;
}