제출 #1005755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1005755		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	18 ms	6104 KiB

triusis

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

typedef long long ll;

#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define f first
#define s second

signed main() {
    IOS;

    ll n, m; cin >> n >> m;
    vector<ll> a(n);
    for (ll i = 0; i < n; i++) cin >> a[i];

    for (ll i = 0; i < n; i++) a[i] -= (i+1) * m;
    
    reverse(a.begin(), a.end());
    cout << endl;
    vector<ll> seq; seq.push_back(-1e9);
    for (ll i = 0; i < n; i++) {
        if (a[i] > 0) continue;
        else if (seq.back() <= a[i]) seq.push_back(a[i]);
        else {
            ll ind = upper_bound(seq.begin(), seq.end(), a[i]) - seq.begin();
            seq[ind] = a[i];
        }
    }
    
    cout << n - (ll)seq.size() + 1 << endl;
}

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