Pagini recente » Cod sursa (job #1667840) | Cod sursa (job #1811543) | Istoria paginii runda/test_miron/clasament | Cod sursa (job #2904071) | Cod sursa (job #226740)
Cod sursa(job #226740)
#include<fstream.h>
int a[5001],n,i,j,p[5001],l[5001],ok[5001],sol[5001];
int main()
{ ifstream fin("secv.in");
ofstream fout("secv.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
l[n]=1;p[n]=n;
for(i=n-1;i>0;i--)
{ l[i]=1;p[i]=i;
for(j=i+1;j<=n;j++)
if(a[i]<a[j]&&l[i]<=l[j])
l[i]=l[j]+1,p[i]=j,ok[i]=1;
}
int max=-1;int k=0;
for(i=1;i<=n;i++)
if(max<l[i])
max=l[i],k=i;
for(i=1,j=k;i<=l[k];i++,j=p[j])
sol[j]=a[j];
for(j=k;sol[j]!=max;j++)
if(sol[j]==0) sol[j]=a[j];
for(j=k;sol[j]!=0;j++)
fout<<sol[j]<<' ';
return 0;
}