Submission #1353466

#TimeUsernameProblemLanguageResultExecution timeMemory
1353466kanapojpmRabbit Carrot (LMIO19_triusis)C++20
100 / 100
45 ms2336 KiB
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    cin >> n >> m;
    vector<int> data(n);
    for(int i=0;i<n;i++){
        cin >> data[i];
        data[i]-=m*(i+1);
        data[i]*=-1;
    }
    vector<int> lis;
    for(int i=0;i<n;i++){
        if(data[i]<0)continue;
        auto it = upper_bound(lis.begin(),lis.end(),data[i]);
        if(it==lis.end())
            lis.push_back(data[i]);
        else
            *it = data[i];
    }
    cout << n - lis.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...