Submission #1261818

#TimeUsernameProblemLanguageResultExecution timeMemory
1261818elib0416Rabbit Carrot (LMIO19_triusis)C++17
0 / 100
2 ms332 KiB
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, m, a;
    cin >> n >> m;
    vector<int> arr;
    for(int i = 0; i < n; i++){
        cin >> a;
        if(a > (i + 1) * m){
            arr.push_back((i + 1) * m - a);
        }
    }
    vector<int> dp;
    for(int x : arr){
        int pos = upper_bound(dp.begin(), dp.end(), x) - dp.begin();
        if(pos == dp.size()){
            dp.push_back(x);
        }else{
            dp[pos] = x;
        }
    }
    cout << n - dp.size();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...