제출 #1153635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1153635		buzdi	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	23 ms	3400 KiB

triusis

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define ld long double

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int NMAX = 2e5;
const ll INF = 1e18;

int n, m, answer;
ll a[NMAX + 1];
ll dp[NMAX + 1];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        a[i] = (ll) m * i - x;
    }

    for(int i = 1; i <= n; i++) {
        dp[i] = INF;
    }
    dp[0] = -INF;

    for(int i = 1; i <= n; i++) {
        if(a[i] >= 0) {
            int l = upper_bound(dp, dp + n + 1, a[i]) - dp;
            dp[l] = a[i];
            answer = max(answer, l);
        }
    }
    cout << n - answer << '\n';

    return 0;
}

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