Pagini recente » Cod sursa (job #916881) | Cod sursa (job #2927918) | Cod sursa (job #957521) | Cod sursa (job #2942383) | Cod sursa (job #175605)
Cod sursa(job #175605)
#include <stdio.h>
const int N = 100001;
int n,v[N],lung[N],pred[N];
void scan(){
int i;
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;++i)
scanf("%d",&v[i]);
}
void solve(){
int i,j;
lung[1]=1;pred[1]=-1;
for (i=2;i<=n;++i){
lung[i]=1;pred[i]=-1;
for (j=1;j<i;++j)
if (v[j]<v[i] && lung[j]>=lung[i]){
lung[i]=lung[j]+1;
pred[i]=j;
}
}
}
void subsir(int x){
if (pred[x]>=0)
subsir(pred[x]);
printf("%d ",v[x]);
}
void print(){
int i,max=0,nmax=0;
for (i=1;i<=n;++i)
if (lung[i]>max){
max=lung[i];
nmax=i;
}
printf("%d\n",max);
subsir(nmax);
}
int main(){
scan();
solve();
print();
}