제출 #1229083

#제출 시각아이디문제언어결과실행 시간메모리
1229083shiovnRabbit Carrot (LMIO19_triusis)C++20
100 / 100
17 ms3112 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pi pair

const long long N=2e5+5;
int a[N],b[N];
vector<int> res;

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

    int n,m;
    cin>>n>>m;

    for(int i=1;i<=n;i++) cin>>a[i];

    int tmp=0;

    for(int i=1;i<=n;i++)
    {
        if(a[i]<=m*i)
        {
            b[tmp++]=m*i-a[i];
        }
    }

    for(int i=0;i<tmp;i++)
    {
        auto it=upper_bound(res.begin(),res.end(),b[i]);
        if(it==res.end()) res.push_back(b[i]);
        else *it= b[i];
    }

    cout<<n-res.size();

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...