Submission #1278034

#TimeUsernameProblemLanguageResultExecution timeMemory
1278034ali190599Rabbit Carrot (LMIO19_triusis)C++20
100 / 100
65 ms4144 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long n,m;
    cin >>n>>m;
    vector<long long> a(n);
    for(int i =0;i<n;i++) {
        cin>>a[i];
    }
    vector<long long>t;
    for(int i=0;i<n;i++){
        long long s=m*(i+1)-a[i];
        if(s>=0){
        auto k= upper_bound(t.begin(), t.end(), s);
        if ( k==t.end()){
        t.push_back(s);
        } else{
        t[k-t.begin()]=s;
        }
        
    }
}
    cout <<n - t.size()<<endl;

    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...