Submission #782183

#	Time	Username	Problem	Language	Result	Execution time	Memory
782183		orcslop	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	26 ms	5240 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size() 

const int MAXN = 2e5; 

int n, m; 
int v[MAXN]; 
vector<int> dp, possible; 

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    cin >> n >> m; 
    for(int i = 0; i < n; i++){
        cin >> v[i]; 
        if(v[i] <= (i + 1) * m) possible.push_back((i + 1) * m - v[i]); 
    }
    for(auto x : possible){
        auto it = upper_bound(dp.begin(), dp.end(), x) - dp.begin(); 
        if(it == sz(dp)) dp.push_back(x); 
        else dp[it] = x; 
    }
    cout << n - sz(dp); 
    return 0; 
}

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