제출 #1194317

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

#define ll long long
#define ff first
#define ss second

const int mxN=2e5;

int a[mxN+1];

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m; cin>>n>>m;
    vector<int> v;
    for(int i=1; i<=n; i++) {
        cin>>a[i];
        int x=i*m-a[i];
        if(x>0) v.push_back(x);
    }
    vector<int> dp;
    for(int i=0; i<v.size(); i++) {
        auto it=upper_bound(dp.begin(), dp.end(), v[i]);
        if(it==dp.end()) {
            dp.push_back(v[i]);
        } else{
            dp[it-dp.begin()]=v[i];
        }
    }
    cout<<n-dp.size();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...