Submission #970237

#TimeUsernameProblemLanguageResultExecution timeMemory
970237vjudge1Rabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms1116 KiB
#include<bits/stdc++.h>

using namespace std;

int main()
{
    int m,n,a[200001];
    cin>>n>>m;
    for(int i=0;i<n;++i)
    {
        cin>>a[i];
        a[i] = -a[i];
    }
    vector<int> v;
    for(int i=0;i<n;++i)
    {
        auto it = upper_bound(v.begin(),v.end(),a[i]);
        if(v.empty() || it == v.end())
        {
            v.push_back(i);
        }
        else
        {
            *it = a[i];
        }
    }
    int ans = v.size()-1;
    if(-a[0]>m) ans = n;
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...