제출 #895946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
895946		omsincoconut	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	25 ms	6096 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

typedef long long int lli;
typedef long double ld;
typedef pair<ld, ld> pld;
typedef pair<lli, lli> pll;
#define mp(x, y) make_pair(x, y)

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    lli N, M;
    cin >> N >> M;
    lli a[N+1];
    a[0] = 0;
    for (lli i = 1; i <= N; i++) cin >> a[i];
    for (lli i = 1; i <= N; i++) a[i] -= i*M;
    reverse(a, a+N+1);
    vector<lli> seq;
    for (lli i = 0; i <= N; i++) {
        if (seq.empty() || seq.back() <= a[i]) seq.push_back(a[i]);
        else {
            auto it = upper_bound(seq.begin(), seq.end(), a[i]);
            *it = a[i];
        }
    }

    for (lli i = seq.size()-1; i >= 0; i--) {
        if (seq[i] == 0) {
            cout << N-i;
            return 0;
        }
    }

    return 0;
}

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