Submission #727905

#	Time	Username	Problem	Language	Result	Execution time	Memory
727905		Azther0z	Rabbit Carrot (LMIO19_triusis)	C++11	100 / 100	98 ms	5256 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n,k;
	cin >> n >> k;
	int pole[n+1];
	for(int i=1;i<=n;i++)
		cin >> pole[i];
	vector<int> unchange;
	for(int i=1;i<=n;i++)
		if(k*i>=pole[i])
			unchange.push_back(k*i-pole[i]);
	vector<int> lis;
	for(auto u:unchange)
	{
		auto it=upper_bound(lis.begin(),lis.end(),u);
		if(it==lis.end()) lis.push_back(u);
		else *it=u;
	}
	cout << n-lis.size();
}

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