Submission #1339673

#	Time	Username	Problem	Language	Result	Execution time	Memory
1339673		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	2 ms	344 KiB

triusis

#include<bits/stdc++.h>
using namespace std;
vector<int> a;
int find_lis(){
	vector<int> dp;
	for(int i : a){
		int pos = upper_bound(dp.begin(), dp.end(), i) - dp.begin();
		if (pos == dp.size()) {
			dp.push_back(i);
		}else{
			dp[pos] = i;
		}
	}
	return dp.size();
}
int main(){
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < n; i++){
		int x;
		cin >> x;
		x = m*i-x;
		a.push_back(x);
	}
	cout << n-find_lis() << endl;
	return 0;
}

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