Pagini recente » Cod sursa (job #2503519) | Cod sursa (job #1658996) | Cod sursa (job #170107) | Cod sursa (job #2913378) | Cod sursa (job #148722)
Cod sursa(job #148722)
#include<fstream.h>
long long v[5000],l[5000],n,i,k,max,t;
int main()
{
ifstream f("subsir2.in");
ofstream g("subsir2.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
for(k=n-1;k>=1;k--)
{
max=0;
for(i=k+1;i<=n;i++)
if(v[i]>=v[k]&&l[i]>max)
max=l[i];
l[k]=1+max;
}
max=l[1]; t=1;
for(k=1;k<=n;k++)
if(l[k]>max)
{
max=l[k];
t=k;
}
g<<max<<"\n"<<v[t]<<" ";
for(i=t+1;i<=n;i++)
if(v[i]>v[t]&&l[i]==max-1)
{
g<<v[i]<<" ";
max--;
}
return 0;
}