Pagini recente » Cod sursa (job #1820855) | Cod sursa (job #334036) | Cod sursa (job #837602) | Cod sursa (job #1855572) | Cod sursa (job #1681088)
#include<fstream>
using namespace std;\
long n,a[100001],l[100001],i,maxx,j,lm,p,t;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
l[n]=1;
for(i=n-1;i>=1;i--)
{
maxx=0;
for(j=i+1;j<=n;j++)
if(l[j]>maxx && a[i]<a[j])maxx=l[j];
l[i]=maxx+1;
if(l[i]>lm)lm=l[i];
}
t=0;p=1;
g<<lm<<"\n";
do
{
while(a[t]>a[p] || l[p]!=lm)p++;
g<<a[p]<<" ";
t=p;
lm--;
}while(lm>0);
f.close();
g.close();
return 0;
}