Pagini recente » Cod sursa (job #2667591) | Cod sursa (job #186471) | Cod sursa (job #657673) | Cod sursa (job #471041) | Cod sursa (job #957702)
Cod sursa(job #957702)
#include <cstdio>
using namespace std;
int x[1001],l[1001],next[1001];
//cel mai lung subsir crescator sau descrescator
int main(){
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int n,i,j,lmax,poz;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&x[i]);
}
l[n]=1;
next[n]=0;
for(i=n-1;i>=1;i--){
l[i]=0;
next[i]=0;
for(j=i+1;j<=n;j++){
if(x[i]<=x[j]){
if(l[j]+1>l[i]){
l[i]=l[j]+1;
next[i]=j;
}
}
}
}
lmax=l[1];
poz=1;
for(i=2;i<=n;i++){
if(l[i]>lmax){
lmax=l[i];
poz=i;
}
}
printf("%d\n",lmax);
while(poz>0){
printf("%d ",x[poz]);
poz=next[poz];
}
return 0;
}