Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define pb push_back
- #define inf INFINITY
- #define mp make_pair
- using namespace std;
- typedef long long ll;
- const int MX= 1e2+3;
- int len[MX],maxlen;
- int mn[MX],n,ar[MX];
- int ans[MX];
- int main()
- {
- cin>>n;
- for(int i=0;i<n;i++)scanf("%d",ar+i);
- for(int i=0;i<n;i++)
- {
- int k;
- int st=0,en=maxlen+1;
- while(st<=en)
- {
- k=(st+en)/2;
- if(len[k]>ar[i])
- en=k-1;
- else st=k+1;
- }
- len[k]=ar[i];
- if(ans[k]==0)ans[k]=ar[i];
- maxlen=max(k,maxlen);
- }
- cout<<maxlen<<endl;
- for(int i=1;i<=maxlen;i++)
- cout<<ans[i]<<' ';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement