Mai intai trebuie sa te autentifici.
Cod sursa(job #2175587)
Utilizator | Data | 16 martie 2018 17:57:33 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <bits/stdc++.h>
#define MAXN 100002
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, m, q, a[MAXN], t[MAXN], pv[MAXN], sol[MAXN];
int bs(int val)
{
int st=1, dr=m, mijl;
while(st<=dr)
{
mijl=st+(dr-st)/2;
if(val>a[t[mijl]]) st=mijl+1;
else dr=mijl-1;
}
return st;
}
int main()
{
int i, k;
fin>>n;
for(i=1; i<=n; i++) fin>>a[i];
t[1]=1, m=1;
for(i=2; i<=n; i++)
{
k=bs(a[i]);
t[k]=i;
pv[i]=t[k-1];
m=max(m,k);
}
fout<<m<<'\n';
for(i=t[m]; i>0; i=pv[i])
sol[++q]=a[i];
for(i=m; i>=1; i--) fout<<sol[i]<<' ';
return 0;
}