Cod sursa(job #1412059)
Utilizator | Data | 1 aprilie 2015 08:48:01 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#include <algorithm>
#define NMAX 100001
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[NMAX], x[NMAX], i, j, n, l=-1, tata[NMAX];
int main()
{
f>>n;
for (i=1; i<=n; ++i)
f>>v[i];
x[n]=1;
for (i=n-1; i>=1; --i)
{
x[i]=1;
for (j=i+1; j<=n; ++j)
if (v[j]>v[i] && x[i]<=x[j])
x[i]=x[j]+1, tata[i]=j;
l=max(l,x[i]);
}
g<<l<<'\n';
for (i=1; i<=n; ++i)
if (x[i]==l) break;
while (tata[i]!=0)
{
g<<v[i]<<" ";
i=tata[i];
if (tata[i]==0) g<<v[i];
}
return 0;
}