제출 #1011350

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1011350		sofija6	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	24 ms	7676 KiB

triusis

#include <bits/stdc++.h>
#define ll long long
#define MAXN 200010
using namespace std;
ll a[MAXN],b[MAXN];
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m,ans;
    cin >> n >> m;
    for (ll i=1;i<=n;i++)
    {
        cin >> a[i];
        b[i]=m*i-a[i];
    }
    vector<ll> cur;
    ans=n;
    for (ll i=1;i<=n;i++)
    {
        if (b[i]<0)
            continue;
        auto it=upper_bound(cur.begin(),cur.end(),b[i]);
        ans=min(ans,n-(it-cur.begin()+1));
        if (it==cur.end())
            cur.push_back(b[i]);
        else
            cur[it-cur.begin()]=min(cur[it-cur.begin()],b[i]);
    }
    cout << ans;
    return 0;
}

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