Submission #1335471

#TimeUsernameProblemLanguageResultExecution timeMemory
1335471whallyRabbit Carrot (LMIO19_triusis)C++20
100 / 100
18 ms1884 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
int lis[200010];

signed main()
{
	cin.tie(0)->sync_with_stdio(0);
	int n,m; cin >> n >> m;
	int mx = 0;
	for (int i = 1; i <= n; i++){
		int x; cin >> x;
		if (m*i < x) continue;
		x = m*i-x;
		int idx = upper_bound(lis, lis+mx, x) - lis;
		if (idx == mx) mx++;
		lis[idx] = x;	
	}
	cout << n-mx;

	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...