Submission #1349134

#TimeUsernameProblemLanguageResultExecution timeMemory
1349134novemnotesRabbit Carrot (LMIO19_triusis)C++20
100 / 100
15 ms4184 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
const int N(2e5+9);

int n,k,ans=0;
int v[N];
vector<int> lis;

int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	cin >> n >> k;
	for(int i=1;i<=n;i++){
		cin >> v[i];
		v[i] = v[i]-(k*i);
	}
	for(int i=n;i>=1;i--){
		if(v[i]>0)continue;
		auto it = upper_bound(lis.begin(),lis.end(),v[i]);
		if(it==lis.end())lis.emplace_back(v[i]);
		else *it = v[i];
	}
	cout << n-lis.size() << "\n";
	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...