Submission #480548

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

triusis

#include <bits/stdc++.h>

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

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