제출 #1278753

#제출 시각아이디문제언어결과실행 시간메모리
1278753IBoryRabbit Carrot (LMIO19_triusis)C++20
100 / 100
18 ms2616 KiB
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	ll N, M;
	cin >> N >> M;

	int ans = 0;
	vector<ll> LIS;
	LIS.push_back(0);
	for (ll i = 1; i <= N; ++i) {
		ll n;
		cin >> n;
		n -= M * i;
		n *= -1;
		if (n < 0) continue;
		if (LIS.back() <= n) LIS.push_back(n);
		else *upper_bound(LIS.begin(), LIS.end(), n) = n;
	}

	cout << N + 1 - LIS.size();
	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...