Pagini recente » tema | Cod sursa (job #2945213) | Clasament oji-2004-ix | Cod sursa (job #1174029) | Cod sursa (job #800390)
Cod sursa(job #800390)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int maxi,i,q,n,p,j,max1,v[100001],b[100001],a[100001];
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>a[i];
b[n]=1;
for(i=n-1;i>=1;--i)
{max1=0;
for(j=i+1;j<=n;++j)
if(a[j]>a[i]&&max1<b[j])
max1=b[j],q=j;
b[i]=max1+1;
v[i]=q;
if(b[i]>maxi)
maxi=b[i],p=i;
}
g<<maxi<<'\n';
g<<a[p]<<' ';
while(v[p]!=0)
{p=v[p];
g<<a[p]<<' ';
}
f.close();
g.close();
return 0;
}