Pagini recente » Cod sursa (job #1436691) | Cod sursa (job #2338618) | Cod sursa (job #2861293) | Cod sursa (job #117754) | Cod sursa (job #2643775)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int l[100001], v[100001];
int main()
{
int n, i, j, max1, max2, poz;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
l[n]=1;
max2=-1;
for(i=n-1; i>=1; i--)
{
max1=-1;
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];
poz=i;
}
}
fout<<max2<<"\n";
while(max2>0)
{
fout<<v[poz]<<' ';
max2--;
for(i=poz+1; i<=n; i++)
{
if(v[i]>v[poz] && l[i]==max2)
{
poz=i;
break;
}
}
}
}