Submission #716566

#	Time	Username	Problem	Language	Result	Execution time	Memory
716566		study	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	24 ms	2260 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

const int N = 2e5+1, M = 5001;

int a[N];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,m;
	cin >> n >> m;
	for (int i=1; i<=n; ++i){
		cin >> a[i];
		a[i] = m*i-a[i];
	}
	vector<int> dp;
	for (int i=1; i<=n; ++i){
		if (a[i] < 0) continue;
		int pos = upper_bound(dp.begin(),dp.end(),a[i])-dp.begin();
		if (pos == dp.size()){
			dp.emplace_back(a[i]);
		}
		else{
			dp[pos] = min(dp[pos],a[i]);
		}
	}
	cout << n-dp.size() << '\n';
	return 0;
}

Compilation message (stderr)

triusis.cpp: In function 'int main()':
triusis.cpp:21:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |   if (pos == dp.size()){
      |       ~~~~^~~~~~~~~~~~

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