Submission #1221390

#TimeUsernameProblemLanguageResultExecution timeMemory
1221390sam230609Rabbit Carrot (LMIO19_triusis)C++20
100 / 100
54 ms3516 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...