This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
signed main(){
int n,d;
cin>>n>>d;
vector<int> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
map<int,int> dp;//ans if max chosen till v[i] was 1
for(int i=0;i<n;i++){
map<int,int> c=dp;
for(auto it=c.begin();it!=c.end();it++){
pair<int,int> x=*it;
if(v[i]>x.F){
dp.erase(x.F);
dp[v[i]]=max(dp[v[i]],x.S+1);
}else break;
}
dp[v[i]]=max(dp[v[i]],1LL);
}
int ans=0;
for(auto x:dp) ans=max(ans,x.S);
cout<<ans<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |