Submission #1088140

#	Time	Username	Problem	Language	Result	Execution time	Memory
1088140		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	58 ms	3928 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
 
int main() {
	int n, m; cin >> n >> m;
	vector<int> arr(n);
	for (int i = 0; i < n; i++) {
		int v; cin >> v;
		arr[i] = v - m * (i + 1);
	}
	reverse(arr.begin(), arr.end());
	vector<int> res(n + 1, INT_MAX);
	res[0] = INT_MIN;
	for (int i = 0; i < n; i++) {
		if (arr[i] > 0) continue;
		int l = upper_bound(res.begin(), res.end(), arr[i]) - res.begin();
		res[l] = arr[i];
	}
	cout << n - (lower_bound(res.begin(), res.end(), INT_MAX) - res.begin() - 1) << endl;
}

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