제출 #1147188

#제출 시각아이디문제언어결과실행 시간메모리
1147188NewtonabcRabbit Carrot (LMIO19_triusis)C++20
100 / 100
16 ms2244 KiB
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
vector<int> v;
int a[N];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,m;
    cin>>n >>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++){
        int tmp=a[i]-m*i;
        if(tmp>0) continue;
        if(v.empty()){
            v.push_back(tmp);
            continue;
        }
        if(tmp<=v.back()){
            v.push_back(tmp);
            continue;
        }
        int l=0,r=v.size()-1;
        while(l<r){
            int mid=(l+r)/2;
            if(v[mid]<tmp) r=mid;
            else l=mid+1;
        }
        v[l]=tmp;
    }
    cout<<n-v.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...