Submission #1147182

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147182		Newtonabc	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1 ms	328 KiB

triusis

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
vector<int> v;
int a[N];
int main(){
    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 ind=upper_bound(v.begin(),v.end(),tmp)-v.begin();
        v[ind]=tmp;
    }
    cout<<n-v.size();
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37