제출 #1090862

#제출 시각아이디문제언어결과실행 시간메모리
10908624QT0RRabbit Carrot (LMIO19_triusis)C++17
100 / 100
74 ms16464 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll wej[200003];
set<pair<ll,ll>> s;
pair<ll,ll> add;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	ll n,m;
	cin >> n >> m;
	s.insert({0,0});
	for (ll i = 1; i<=n; i++){
		cin >> wej[i];
		auto it=s.lower_bound({wej[i]-m-add.first,-1e9});
		add.first+=m;
		add.second++;
		if (it!=s.end()){
			ll val=(*it).second;
			if (it!=s.begin()){
				it--;
				s.erase(it);
			}
			s.insert({wej[i]-add.first,val-1});
		}
	}
	cout << (*s.begin()).second+add.second << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...