제출 #705711

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
705711		Mathandski	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	79 ms	6836 KiB

triusis

#define pb push_back
#define mp make_pair
#define mt make_tuple
#define is insert
#define ll long long
#define f0r(i, begin, n) for (ll i = begin; i < n; i ++)
#define len(x) x.length()
#define sz(x) x.size()
#include <bits/stdc++.h>
using namespace std;

int main () {
	ifstream fin; ofstream fout;
	fin.open("cowjog.in"); fout.open("cowjog.out");

	ll N, M; cin >> N >> M;
	vector<ll> lis = {0};
	f0r (i, 1, N + 1) {
		ll a; cin >> a;
		a -= M * i;
		lis.pb(-a);
	}
	
	vector<ll> dp;
	for (ll i : lis) {
		if(i < 0) {
			continue;
		}
		ll pos = upper_bound(dp.begin(), dp.end(), i) - dp.begin();
		if (pos == dp.size()) {
			// we can have a new, longer increasing subsequence!
			dp.push_back(i);
		} else {
			// oh ok, at least we can make the ending element smaller
			dp[pos] = i;
		}
	}
	cout << N - dp.size() + 1 << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

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

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