Submission #785263

#TimeUsernameProblemLanguageResultExecution timeMemory
785263kebineGlobal Warming (CEOI18_glo)C++17
0 / 100
2080 ms1192 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second

ll n,x;
vector<int> a(200005,0);
int lis[200005];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin>>n>>x;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    if(x==0){
        int mx=0;
        lis[n]=1;
        for(int i=n-1;i>0;i--){
            lis[i]=1;
            for(int j=i+1;j<n;j++){
                if(a[i]<a[j]) lis[i]=max(lis[i],lis[j]+1);
            }
            mx=max(mx,lis[i]);
        }
        cout<<mx<<'\n';;
    }

    return 0;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...