Cod sursa(job #2300680)
| Utilizator | Data | 11 decembrie 2018 21:08:41 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,i,v[100000],l[100000],poz[100000],j;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
l[n]=0;
poz[n]=0;
for(i=n-1;i>=1;i--)
{
for(j=n;j>i;--j)
if(v[i]<v[j] && l[i]<=l[j] )
{
l[i]=l[j]+1;
poz[i]=j;
}
}
int len=0, start;
for(i=1;i<=n;++i) if(len<l[i]){len=l[i];start=i;}
fout<<len+1<<endl;
for(i=0;i<=len;++i)
{
fout<<v[start]<<' ';
start=poz[start];
}
return 0;
}
