Pagini recente » Cod sursa (job #2559822) | Cod sursa (job #2932782) | Borderou de evaluare (job #748049) | Cod sursa (job #1037510) | Cod sursa (job #2426457)
#include <fstream>
#define Nmax 100005
using namespace std;
int n, i, j, p, maxx, v[Nmax], lu[Nmax];
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f >> n;
for(i = 1; i <= n; ++ i)
f >> v[i];
lu[n] = 1;
for(i = n - 1; i > 0; i --)
{
maxx = 0;
for(j = i + 1; j <= n; j ++)
if(v[j] > v[i] && lu[j] > maxx)
maxx = lu[j];
lu[i] = maxx + 1;
}
maxx = 0;
for(i = 1; i <= n; ++ i)
if(maxx < lu[i]) maxx = lu[i], p = i;
g << maxx << "\n";
g << v[p] << " ";
for(i = p + 1; i <= n; ++ i)
if(v[i] > v[p] && lu[i] == maxx - 1)
{
g << v[i] << " ";
maxx --;
}
return 0;
}