Submission #482489

#	Time	Username	Problem	Language	Result	Execution time	Memory
482489		Deepesson	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	1 ms	204 KiB

triusis

#include <bits/stdc++.h>

int main()
{
    int N,M;
    std::cin>>N>>M;
    std::vector<int> vec;
    int alturas[N];
    for(int i=0;i!=N;++i){
        int h;
        std::cin>>h;
        alturas[i]=h;
        vec.push_back(h-(M*i));
    }
    std::reverse(vec.begin(),vec.end());
    std::vector<int> veco;
    for(int i=0;i!=N;++i){
        if((i+1)*M<alturas[i])continue;
        int x = vec[i];
        auto it = std::lower_bound(veco.begin(),veco.end(),x);
        if(it!=veco.end()){
            *it=x;
        }else veco.push_back(x);
    }
    std::cout<<(N-veco.size())<<"\n";
}

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