Pagini recente » Istoria paginii preoni-2008/clasament/runda-2/11-12 | Cod sursa (job #1184073) | Cod sursa (job #348645) | Cod sursa (job #2575098) | Cod sursa (job #674288)
Cod sursa(job #674288)
#include<stdio.h>
using namespace std;
int i,j,n,t[100001],l[100001],poz[100001],max,p;
void din()
{
for(i=n-2;i>=0;--i)
for(j=i+1;j<n;++j)
if(t[i]<t[j] && l[i]<l[j]+1)
{
l[i]=l[j]+1;
poz[i]=j;
if(max<l[i]) {max=l[i]; p=i;}
}
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=0;i<n;++i)
scanf("%d",&t[i]);
for(i=0;i<n;++i) l[i]=1;
din();
printf("%d\n",max);
i=p;
do
{
printf("%d ",t[i]);
i=poz[i];
}while(!(l[i]==1));
printf("%d\n",t[i]);
return 0;
}