제출 #330095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330095		alien_lover	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	1 ms	364 KiB

triusis

#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>

using namespace std;

typedef long long ll;

#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()

const int PRIME = 1e9 + 7;


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

    int n;
    ll m;
    cin >> n >> m;
    
    vector<ll> alteredHeights(n);

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

    vector<ll> dp;
    dp.push_back(LLONG_MIN);

    for(int i = 0; i < n; i++){
        if(alteredHeights[i] < 0){
            continue;
        }
        int ind = upper_bound(dp.begin(), dp.end(), alteredHeights[i]) - dp.begin();
        if(ind == sz(dp)){
            dp.push_back(0);
        }else{
            dp[ind] = alteredHeights[i];
        }
    }

    cout << n - dp.size() + 1 << '\n';
}

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