Pagini recente » Cod sursa (job #525824) | Cod sursa (job #834592) | Cod sursa (job #2968499) | Cod sursa (job #1488176) | Cod sursa (job #1535148)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,a[100001],l[100001],max1,i,j,p;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>a[i];
l[n]=1;
for(i=n-1;i>=1;i--)
{max1=0;
for(j=i+1;j<=n;j++)
{if(l[j]>max1&&a[j]>a[i])max1=l[j];
}
l[i]=max1+1;
}
max1=0;
for(i=1;i<=n;i++)
{if(l[i]>max1){p=i;max1=l[i];}
}
g<<max1<<'\n';
while(max1)
{g<<a[p]<<" ";
max1--;
for(j=p+1;j<=n;j++)
{if(l[j]==max1&&a[j]>a[p]){p=j;break;}
}
}
return 0;
}