Mai intai trebuie sa te autentifici.
Cod sursa(job #179625)
Utilizator | Data | 16 aprilie 2008 10:27:42 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<stdio.h>
long long s[100001],a[100001],poz[100001],max,n,i,j,pozmax;
int main()
{ freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%lld",&n);
for(i=1;i<=n;i++)scanf("%lld",&s[i]);
a[n]=1;poz[n]=-1;
for(i=n-1;i>0;i--)
for(j=i+1;j<=n;j++)
if(s[i]<s[j]&&a[i]<a[j]+1)
{ a[i]=a[j]+1;poz[i]=j;}
max=a[1];
for(i=2;i<=n;i++)
if(a[i]>max) {max=a[i];pozmax=i;}
printf("%lld\n",max);
i=pozmax;
while(i!=-1)
{ printf("%lld ",s[i]);
i=poz[i];
}
return 0;
}