Submission #947233

#TimeUsernameProblemLanguageResultExecution timeMemory
947233VMaksimoski008Rabbit Carrot (LMIO19_triusis)C++14
63 / 100
1049 ms2396 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, h;
    cin >> n >> h;

    vector<int> v(n+1), dp(n+1, 0);
    for(int i=1; i<=n; i++) cin >> v[i], v[i] = 1ll * h * i - v[i];

    for(int i=1; i<=n; i++)
        for(int j=0; j<i; j++)
            if(v[i] >= v[j] && v[i] >= 0) dp[i] = max(dp[i], dp[j] + 1);

    cout << n - *max_element(dp.begin(), dp.end()) << '\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...