Submission #1096966

#	Time	Username	Problem	Language	Result	Execution time	Memory
1096966		andrewp	Rabbit Carrot (LMIO19_triusis)	C++14	63 / 100	1034 ms	3928 KiB

triusis

//Dedicated to my love, ivaziva
#pragma GCC optimize("Ofast") 
#include <bits/stdc++.h> 
using namespace std;   
 
#define int long long 
 
using pii = pair<int, int>;
using ll = int64_t;  
  
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back  
#define dbg(x) cerr<<#x<<": "<<x<<'\n';  
#define dbga(A,l_,r_){for(int i_=l_;i_<=r_;i_++)cerr<<A[i_]<<' ';cerr<<'\n';}
#define dbgv(a_){for(auto x_:a_) cerr<<x_<<' ';cerr<<'\n';}   

const int maxn = 2e5 + 10, inf = 1e9;
int n, m, a[maxn], dp[maxn];

int32_t main()  {
    ios::sync_with_stdio(false); cin.tie(nullptr);  
    cout.tie(nullptr); cerr.tie(nullptr);
    
    cin >> n >> m; 
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        dp[i] = -inf;
    }
    for (int i = 0; i <= n; i++) {
        a[i] += (n - i) * m;
    } 
    dp[0] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = i - 1; j >= 0; j--) {
            if (a[j] >= a[i]) {
                dp[i] = max(dp[j] + 1, dp[i]);
            } 
        } 
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        ans = max(ans, dp[i]);
    }
    cout << n - ans << '\n';
    return 0;       
}

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