Submission #644329

#TimeUsernameProblemLanguageResultExecution timeMemory
644329KarukRabbit Carrot (LMIO19_triusis)C++14
100 / 100
94 ms3788 KiB
#include<bits/stdc++.h>
using namespace std;
int main() {
    long long n,d;cin>>n>>d;
    vector<long long>a(n+1,1e18);
    int maxpos=-1;
    for(int i=1;i<=n;i++) {
        long long x;cin>>x;
        x-=i*d;
        if(x>0)continue;
        x=abs(x);
        int pos=upper_bound(a.begin(),a.end(),x)-a.begin();
        a[pos]=x;
        maxpos=max(maxpos,pos);
    }
    maxpos++;
    cout<<n-maxpos<<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...