제출 #1331522

#제출 시각아이디문제언어결과실행 시간메모리
1331522kawhietSafety (NOI18_safety)C++20
7 / 100
2101 ms196204 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long

constexpr int N = 5001;
constexpr int inf = 1e18;

int a[N];
int dp[N][N];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, h;
    cin >> n >> h;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            dp[i][j] = inf;
        }
    }
    for (int i = 0; i < N; i++) {
        dp[0][i] = abs(i - a[0]);
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < N; j++) {
            for (int k = 0; k < N; k++) {
                if (abs(j - k) > h) continue;
                dp[i][j] = min(dp[i][j], dp[i - 1][k] + abs(a[i] - j));
            }
        }
    }
    int ans = inf;
    for (int i = 0; i < N; i++) {
        ans = min(ans, dp[n - 1][i]);
    }
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...