Submission #480555

#	Time	Username	Problem	Language	Result	Execution time	Memory
480555		Deepesson	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	103 ms	4928 KiB

triusis

#include <bits/stdc++.h>

int main()
{
    int N,T;
    std::cin>>N>>T;
    int array[N],valores[N];for(auto&x:array)std::cin>>x;
    for(int i=0;i!=N;++i){
        valores[i]=array[i];
        array[i]-=(T*i);
    }
    for(auto&x:array)x*=-1;
    /*for(int i=0;i!=N;++i){
        std::cout<<array[i]<<" ";
    }
    std::cout<<"\n";*/
    std::vector<int> pilha;
    for(int i=0;i!=N;++i){
        if((i+1)*T<valores[i])continue;
        int x=array[i];
        auto it=std::upper_bound(pilha.begin(),pilha.end(),x);
        if(it==pilha.end()){
            pilha.push_back(x);
        }else *it=x;
    }
    std::cout<<(N-pilha.size())<<"\n";
}

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