Pagini recente » Cod sursa (job #471602) | Cod sursa (job #2863473) | Cod sursa (job #976215) | Cod sursa (job #2345253) | Cod sursa (job #1414234)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int l[260],urm[260],v[200];
int main()
{
int n,i,j,mn,mx = 0,ur;
f>>n;
for(i = 1; i <= n; i++)
f>>v[i];
for(i = n - 1; i >= 1; i--)
{
mn = -1;
urm[i] = 0;
l[i] = 1;
for(j = i + 1; j <= n; j++)
if(v[i] < v[j] && l[j] > mn)
{
mn = l[j];
urm[i] = j;
}
l[i] = mn + l[i];
if(l[i] > mx)
{
ur = i;
mx = l[i];
}
}
g<<mx<<"\n";
while(ur != 0)
{
g<<v[ur]<<" ";
ur = urm[ur];
}
return 0;
}