#include <bits/stdc++.h>
using namespace std;
int cal(const vector<int> &s){
vector<int> v;
for(int i:s){
int pos=upper_bound(v.begin(),v.end(),i)-v.begin();
if(pos==v.size()) v.push_back(i); else v[pos]=i;
}return v.size();
}
int main() {
int n,m; cin >>n>>m; vector<int> v,p(n);
for(int i=0;i<n;i++) cin >>p[i];
for(int i=1;i<=n;i++){
if(i*m>=p[i-1]) v.push_back(i*m-p[i-1]);
}cout <<n-cal(v);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |