题目链接
题意:
一个n*m的矩阵,每个格子有一个高度。
要从(1,1)走到(n,m)每次只能往上下左右走,且只能走到比当前格子高度大1的格子
刚开始可以执行操作:将任意一个格子高度-1 格子高度可以小于等于0
问至少执行多少次操作可以从(1,1)走到(n,m)
思路:
枚举(1,1)处可能的高度:aij-j-i+2
然后dp
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[105][105];
ll dp[105][105];
ll n, m;
int main()
{
ll T;
scanf("%lld", &T);
while (T--)
{
ll k, i, j, i1, j1, ans = 1e18;
scanf("%lld%lld", &n, &m);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= m; j++)
{
scanf("%lld", &a[i][j]);
}
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= m; j++)
{
for (i1 = 1; i1 <= n; i1++)
{
for (j1 = 1; j1 <= m; j1++)
{
dp[i1][j1] = 1e18;
}
}
ll x = a[i][j] - i - j + 2;
if (a[1][1] < x)
continue;
dp[1][1] = a[1][1] - x;
for (i1 = 1; i1 <= n; i1++)
{
for (j1 = 1; j1 <= m; j1++)
{
if (i1 < n && a[i1 + 1][j1] >= x + i1 + 1 + j1 - 2)
dp[i1 + 1][j1] = min(dp[i1 + 1][j1], dp[i1][j1] + a[i1 + 1][j1] - (x + i1 + 1 + j1 - 2));
if (j1 < m && a[i1][j1 + 1] >= x + i1 + j1 + 1 - 2)
dp[i1][j1 + 1] = min(dp[i1][j1 + 1], dp[i1][j1] + a[i1][j1 + 1] - (x + i1 + 1 + j1 - 2));
}
}
ans = min(ans, dp[n][m]);
}
}
printf("%lld\n", ans);
}
}