제출 #1205426

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1205426		ofoz	Rabbit Carrot (LMIO19_triusis)	C++20	63 / 100	1095 ms	3396 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define vi vector<int>

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int &x : a) cin >> x;
    a.insert(a.begin(), 0);
    a.push_back(INT32_MIN);
    n += 2;
    vi dp(n, INT32_MAX);
    dp[0] = 0;
    for (int i = 1; i < n; i++) {
        if (a[i] - a[i-1] <= m) dp[i] = dp[i-1];
        for (int j = 0; j < i; j++) {
            int diff = i - j - 1;
            if ((a[i] - a[j]) > (diff + 1) * m) continue;
            dp[i] = min(dp[i], dp[j] + diff);
        }
    }
    cout << dp[n-1];
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    solve();
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 0 / 37