Pagini recente » Cod sursa (job #296611) | Cod sursa (job #3202905) | Cod sursa (job #3002966) | Borderou de evaluare (job #3273669) | Cod sursa (job #1800246)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,v[100000],max1,l[100000],j;
int main()
{
f>>n;
for (i=1; i<=n; i++)
f>>v[i];
l[n]=1;
for (i=n-1; i>=1; i--)
{
max1=0;
for (j=i+1; j<=n; j++)
if (v[i]<v[j] && l[j]>max1 ) max1=l[j];
l[i]=1+max1;
}
int i1;
max1=0;
for (i=1;i<=n;i++)
if (l[i]>max1) {i1=i;max1=l[i];};
g<<max1<<'\n';
g<<v[i1]<<' ';
for (i=i1;i<=n;i++)
if (l[i]<l[i1] && v[i]>v[i1]) {g<<v[i]<<' '; l[i1]=l[i];v[i1]=v[i];}
return 0;
}