Pagini recente » Cod sursa (job #2775081) | Cod sursa (job #2136436) | Cod sursa (job #2373619) | Cod sursa (job #1147199) | Cod sursa (job #2643954)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int v[100001], l[100001];
int main()
{
int n, i, j, max1, max2;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
max2=1;
l[n]=1;
for(i=n-1; i>=1; i--)
{
max1=0;
for(j=i+1; j<=n; j++)
{
if(v[j] > v[i] && l[j]>max1)
{
max1=l[j];
}
}
l[i]=max1+1;
if(l[i]>max2) max2=l[i];
}
for(i=1; i<=n; i++)
{
if(l[i]==max2)
{
break;
}
}
fout<<max2<<"\n";
while(max2>0)
{
if(l[i]==max2)
{
fout<<v[i]<<' ';
max2--;
}
else i++;
}
}