Kattis - Just Passing Through_e - just passing through kattis

本文链接：https://blog.csdn.net/sjyisdog/article/details/119653027

博客内容涉及使用动态规划解决一个关于通过山脉路径的问题，其中`pass`变量标识可以通过的点，`dp`数组记录到达每个位置并经过特定数量`pass`点的最短海拔。代码中首先预处理`pass`，然后用动态规划填充`dp`数组，最后找出从起点到终点经过所有`pass`点的最短总高度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题链接：

https://vjudge.net/problem/Kattis-justpassingthrough
https://open.kattis.com/problems/justpassingthrough

AC代码：

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
const int INF = 0x3fffffff;
typedef long long ll;
typedef unsigned long long ull;

void __init__()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
} //head

int r, c, n;
int dp[1000][1000][20];
int pass[1000][1000];
int mp[1000][1000];
int x[4] = {0, 1, -1, 0};
int y[4] = {1, 0, 0, -1};

int main()
{
    __init__();
    cin >> r >> c >> n;
    memset(mp, -1, sizeof(mp));
    for (int i = 1; i <= r; i++)
    {
        for (int j = 1; j <= c; j++)
        {
            cin >> mp[i][j];
        }
    }
    for (int i = 1; i <= r; i++)
    {
        for (int j = 1; j <= c; j++)
        {
            if (mp[i][j] == -1)
                continue;
            int flag = 1;
            for (int k = 0; k < 4; k++)
            {
                if (mp[i + x[k]][j + y[k]] == -1)
                {
                    flag = 0;
                }
            }
            if (flag && mp[i - 1][j] > mp[i][j] && mp[i + 1][j] > mp[i][j] && mp[i][j - 1] < mp[i][j] && mp[i][j + 1] < mp[i][j])
            {
                pass[i][j] = 1;
            }
        }
    }
    for (int i = 0; i <= r + 1; i++)
    {
        for (int j = 0; j <= c; j++)
        {
            for (int k = 0; k <= n; k++)
            {
                dp[i][j][k] = INF;
            }
        }
    }
    for (int i = 1; i <= r; i++)
    {
        dp[i][0][0] = 0;
    }
    for (int j = 1; j <= c; j++)
    {
        for (int i = 1; i <= r; i++)
        {
            for (int k = pass[i][j]; k <= n; k++)
            {
                if (mp[i][j] == -1)
                    continue;
                if (mp[i][j - 1] >= 0 || j == 1)
                    dp[i][j][k] = min(dp[i][j][k], dp[i][j - 1][k - pass[i][j]] + mp[i][j]);
                if (mp[i - 1][j - 1] >= 0 || j == 1)
                    dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - 1][k - pass[i][j]] + mp[i][j]);
                if (mp[i + 1][j - 1] >= 0 || j == 1)
                    dp[i][j][k] = min(dp[i][j][k], dp[i + 1][j - 1][k - pass[i][j]] + mp[i][j]);
            }
        }
    }
    int ans = INF;
    for (int i = 1; i <= r; i++)
        ans = min(ans, dp[i][c][n]);

    if (ans == INF)
        cout << "impossible\n";
    else
        cout << ans << endl;
    return 0;
}