제출 #1012948

#제출 시각아이디문제언어결과실행 시간메모리
1012948davieduRabbit Carrot (LMIO19_triusis)C++17
100 / 100
19 ms6104 KiB
#include <bits/stdc++.h>
using namespace std;

#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long

struct P{
    ll x, y;
};

void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

signed main(){
    fastio;
    ll n, m;
    cin >> n >> m;
    vector<ll> arr (n);
    for (ll i=0; i<n; i++){
        cin >> arr[i];
    }
    vector<ll> lis;
    ll cur=0;
    for (int i=0; i<n; i++){
        cur += m;
        if (arr[i] > cur) continue;
        ll c = cur - arr[i];
        int p = upper_bound(all(lis), c) - lis.begin();
        if (p == (int) lis.size()) lis.push_back(c);
        else lis[p] = c;
    }

    cout << n - lis.size() << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...