Submission #1226313

#	Time	Username	Problem	Language	Result	Execution time	Memory
1226313		piedav	Rabbit Carrot (LMIO19_triusis)	C++20	63 / 100	1095 ms	1860 KiB

triusis

//naive solution
#include <iostream>
#include <vector>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    vector<int> a (n+1, 0);
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
        a[i] -= m*i;
    }

    //find the longest nonincreasing subsequence starting with 0
    int ans = 0;
    vector<int> dp(n+1, 0);
    dp[0] = 1;
    for(int i = 0; i < a.size(); ++i) {
        for(int j = 0; j < i; ++j) {
            if(dp[j] == 0) continue;
            if(a[j] >= a[i]) {dp[i] = max(dp[i], dp[j]+1);}
        }
        ans = max(ans, dp[i]);
    }
    cout << n+1-ans;
    //cout << endl << ans;
}

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