Pagini recente » Istoria paginii utilizator/vlad_pris | Istoria paginii utilizator/mihnearipanu | Cod sursa (job #200728) | Istoria paginii utilizator/khazar | Cod sursa (job #2484076)
#include <fstream>
#define N 100001
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[N],n;
int poz[N];
int lg[N];
int pozmax;
int lgmax;
void Read()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
}
void Solve()
{
int i,j;
poz[1]=0;
lg[1]=1;
for(i=2; i<=n; i++)
{
lg[i]=1;
for(j=1; j<=i-1; j++)
if(v[j]<v[i])
if(lg[j]+1 > lg[i])
{
lg[i]=lg[j]+1;
poz[i]=j;
}
}
for(i=1; i<=n; i++)
if(lg[i]>lgmax)
{
pozmax=i;
lgmax=lg[i];
}
}
void Afisare(int p)
{
if(p!=0)
{
Afisare(poz[p]);
fout<<v[p]<<" ";
}
}
int main()
{
Read();
Solve();
fout<<lgmax<<"\n";
Afisare(pozmax);
return 0;
}