Pagini recente » Cod sursa (job #2033105) | Cod sursa (job #2855977) | Cod sursa (job #2789167) | Cod sursa (job #544795) | Cod sursa (job #1635290)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int x[100001],z[100001],n,i,smax,j,start[100001];
int main()
{
f >> n;
for (i=1;i<=n;i++)
f >> x[i];
z[n]=1;start[n]=1;
for (i=n-1;i>=1;i--)
{
for (j=1;j<=n;j++)
if (x[i]<x[j] && z[i]<z[j]) {z[i]=z[j]+1;start[i]=j;}
if (z[i]>z[smax]) smax=i;
}
g << z[smax] << "\n";
while (start[smax])
{
g << x[smax] << ' ';
smax=start[smax];
}
return 0;
}