Submission #480667

#	Time	Username	Problem	Language	Result	Execution time	Memory
480667		ASIXER	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	38 ms	3652 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll mod = (ll)1e9+7;

void solve(){
	int n,m; cin>>n>>m;
	vector<int> a(n);
	for(int i=0;i<n;i++){
		cin>>a[i];
		a[i]-=(i+1)*m;
	}
	reverse(a.begin(),a.end());
	vector<int> lis;
	for(auto ai:a){
		int pos=upper_bound(lis.begin(),lis.end(),ai)-lis.begin();
		if(pos==(int)lis.size()) lis.push_back(ai);
		else lis[pos]=ai;
	}
	cout<<n-(upper_bound(lis.begin(),lis.end(),0)-lis.begin())<<"\n";
}
int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int T=1; //cin>>T; 
	while(T--) solve();
	return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37