Submission #563390

#TimeUsernameProblemLanguageResultExecution timeMemory
563390guagua0407Rabbit Carrot (LMIO19_triusis)C++17
100 / 100
85 ms13144 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main() {_
	ll n,m;
	cin>>n>>m;
	ll b[n];
	for(ll i=0;i<n;i++){
		ll x;
		cin>>x;
		b[i]=m*(i+1)-x;
		//cout<<b[i]<<' ';
	}
	//cout<<'\n';
	multiset<ll> s;
	s.insert(0);
	for(ll i=0;i<n;i++){
		if(b[i]<0) continue;
		if(s.upper_bound(b[i])!=s.end()) s.erase(s.upper_bound(b[i]));
		s.insert(b[i]);
	}
	for(auto it=s.begin();it!=s.end();it++){
		//cout<<*it<<' ';
	}
	cout<<'\n';
	cout<<n-s.size()+1;
	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...