Submission #824139

#TimeUsernameProblemLanguageResultExecution timeMemory
824139dis1309Rabbit Carrot (LMIO19_triusis)C++14
100 / 100
26 ms5948 KiB
#include <bits/stdc++.h>
#define mod 1e9+7
#define ll long long
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,x,m; cin>>n>>m;
vector<ll> v(n);
for(ll i = 0; i<n; i++) {
    cin>>x;
    v[i] = m*(i+1) - x;
}
vector<ll> dp;
for(ll i = 0; i<n; i++) {
  if(v[i] < 0) continue;
  if(dp.empty() || v[i] >= dp.back()) dp.push_back(v[i]);
  else *lower_bound(dp.begin(),dp.end(),v[i]+1) =  v[i];
}
cout<<n-dp.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...