제출 #1306071

#제출 시각아이디문제언어결과실행 시간메모리
1306071xnoelRabbit Carrot (LMIO19_triusis)C++20
100 / 100
65 ms4144 KiB
#include <bits/stdc++.h>
using namespace std;

int main(){
    //freopen("1.in","r",stdin);
    long long n,jump;
    cin>>n>>jump;
    
    vector<long long> a(n);
    for (long long i=0;i<n;i++) cin>>a[i];
    reverse(a.begin(),a.end());
    for (long long i=0;i<n;i++) a[i]+=jump*i;

   

    long long last=n*jump;

    // for (auto num:a) cout<<num<<" ";
    // cout<<"\n";
    // cout<<"last: "<<last<<"\n";

    vector<long long> dp;
    for (auto num:a) {
        if (num>last) continue;
        auto it = upper_bound(dp.begin(),dp.end(),num);
        if (it==dp.end()) dp.push_back(num);
        else *it = num;
    }
    // for (auto num:dp) cout<<num<<" ";
    // cout<<"\n";
    cout<<n-dp.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...