Submission #369945

#	Time	Username	Problem	Language	Result	Execution time	Memory
369945		XEMPLI5	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	95 ms	5984 KiB

triusis

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

const int mod = 1e9+7;
long long n, m, mxN = 2e5+10;
vector<long long> vals(mxN);

int main(){
	cin >> n >> m;
	for(int i=0; i<n; i++) {
		cin >> vals[i];
		vals[i] = m * (i+1) - vals[i];
	}
	vector<long long> dp;
	long long ans = 0;
	for(int i=0; i<n; i++){
		if(vals[i] >= 0){
			int pos = upper_bound(dp.begin(), dp.end(), vals[i]) - dp.begin();
			if(pos == dp.size()) {
				ans++;
				dp.push_back(vals[i]);
			} else dp[pos] = vals[i];
		}
	}
	cout << n-ans << '\n';
	return 0;
}

Compilation message (stderr)

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

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