Submission #1230053

#TimeUsernameProblemLanguageResultExecution timeMemory
1230053lazyboi009Rabbit Carrot (LMIO19_triusis)C++20
100 / 100
59 ms4544 KiB
#include<bits/stdc++.h>
using namespace std;
const long long N=2e5+5;
long long a[N],b[N];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    vector<int>res;
    long long j=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]<=m*i)
        {
            b[j++]=m*i-a[i];
        }
    }
    for(int i=0;i<j;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...