Pagini recente » Cod sursa (job #1604522) | Cod sursa (job #977934) | Cod sursa (job #1423474) | Cod sursa (job #1620713) | Cod sursa (job #2525072)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
///8 4 3 2 3 4 5 1 2 5 6 1 1 1 7 8 9 5
int n,maxm,xx=0,index;
f>>n;
int v[30],e[30];
for (int i=0;i<n;i++)
f>>v[i];
e[n-1]=1;
for (int i=n-2;i>=0;i--)
{
maxm=0;
for (int j=i+1;j<n;j++)
{
if (v[i]<v[j] && e[j]>maxm)
{
maxm=e[j];
}
}
if (maxm>xx)
{
xx=maxm+1;
index=i;
}
e[i]=maxm+1;
}
g<<xx<<endl;
g<<v[index];
xx--;
for (int j=index;xx>=1;j++)
{
if (v[index]<v[j] && e[j]==xx)
{
index=j;
xx--;
g<<' '<<v[index];
}
}
}