제출 #1349341

#제출 시각아이디문제언어결과실행 시간메모리
1349341karn7777Rabbit Carrot (LMIO19_triusis)C++20
100 / 100
45 ms4080 KiB
#include<bits/stdc++.h>
#define int long long
#define N 200005
using namespace std;
int arr[N];
signed main(){
    vector<int> vec;
    int n,k;
    cin >> n >> k;
    for(int i=1;i<=n;i++){
        cin >> arr[i];
        arr[i]=(arr[i]-k*i);
    }
    for(int i=n;i>=1;i--){
        if(arr[i]<=0){
            auto it=upper_bound(vec.begin(),vec.end(),arr[i]);
            if(it==vec.end())vec.push_back(arr[i]);
            else *it=arr[i];
        }
    }
    cout << n-vec.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...