Pagini recente » Cod sursa (job #2841038) | Cod sursa (job #1215009) | Cod sursa (job #764076) | Cod sursa (job #2214158) | Cod sursa (job #486956)
Cod sursa(job #486956)
#include<fstream>
#include<cstdio>
using namespace std;
long i,j,n,maxim,k,t;
long v[100001],l[100001];
int main()
{
ifstream f("scmax.in");
//ofstream g("scmax.out");
freopen ("scmax.out","w",stdout);
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
for(k=n;k>=1;k--)
{
maxim=0;
for(i=k+1;i<=n;i++)
if(v[i]>v[k]&&l[i]>maxim)
maxim=l[i];
l[k]=1+maxim;
}
/* for(i=1;i<=n;i++)
g<<l[i]<<" ";
g<<"\n";
for(i=1;i<=n;i++)
g<<v[i]<<" ";
g<<"\n";*/
for(i=1;i<=n;i++)
if(maxim<l[i])
{
maxim=l[i];
t=i;
}
//g<<maxim<<"\n";
//g<<v[t]<<" ";
printf("%d\n",maxim);
printf("%d ",v[t]);
for(i=t+1;i<=n;i++)
if(v[i]>v[t]&&l[i]==maxim-1)
{
// g<<v[i]<<" ";
printf("%d ",v[i]);
maxim--;
}
return 0;
}