Pagini recente » Cod sursa (job #2190497) | Cod sursa (job #813356) | Cod sursa (job #500931) | Cod sursa (job #175265) | Cod sursa (job #1358918)
#include <iostream>
#include <fstream>
using namespace std;
long n,lung[100000],urm[100000],a[100000],maxim=0;
int i,j,indice;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
fin>>n;
for(i = 1 ; i <= n ; ++ i)
fin>>a[i];
for(i = n ; i >= 1 ; -- i)
lung [i] = 1;
for(j = n ; j > 1 ; -- j)
{
if(a[i] < a[j])
if(lung[1] < lung[j] + 1)
{
lung[i] = lung[j] + 1;
urm[i] = j;
if(lung[i] > maxim)
{
maxim = lung[i];
indice = i;
}
}
}
fout<<maxim<<'\n';
while(indice != 0)
{
cout<<a[indice]<<" ";
indice = urm[indice];
}
return 0;
}