Cod sursa(job #2611416)
| Utilizator | Data | 6 mai 2020 20:33:02 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
const int lim=1e5+3;
int bst[lim],last[lim];
int main()
{
int n,a,ans=0;
cin>>n;
for(int i=1;i<=n;++i)
{
cin>>a;
int l=0,r=ans,med;
while(l<r)
{
if(r==l+1)
med=r;
else med=(l+r)/2;
if(bst[med]<a)
l=med;
else r=med-1;
}
bst[l+1]=a;
last[l+1]=bst[l];
ans=max(ans,l+1);
}
cout<<ans<<endl;
for(int i=2;i<=ans;++i)
cout<<last[i]<<' ';
cout<<bst[ans];
return 0;
}
