Cod sursa(job #2129442)
| Utilizator | Data | 12 februarie 2018 20:37:42 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
long long n,m,k,v[100005],i,j,l[100005],poz[100005];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=n;i>0;i--)
{
l[i]=1;poz[i]=0;
for(j=i+1;j<=n;j++)
if(v[i]<v[j]&&l[i]<1+l[j])
{
l[i]=1+l[j];
poz[i]=j;
}
if(m<l[i]){m=l[i];k=i;}
}
fout<<m<<endl;
for(i=k;i>0;i=poz[i])
fout<<v[i]<<' ';
}
