Cod sursa(job #1714632)
| Utilizator | Data | 8 iunie 2016 22:11:10 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,maxx=0,v[10001],a[10001],k[10001],t[10001];
int main()
{
int i,j,nr;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
v[i]=1;
nr=0;
for(j=1;j<i;j++)
if(a[i]>a[j] && v[i]<(v[j]+1))
{
k[++nr]=a[j];
v[i]=v[j]+1;
}
k[v[i]]=a[i];
if(v[i]>maxx)
{
maxx=v[i];
for(j=1;j<=maxx;j++)
t[j]=k[j];
}
}
fout<<maxx<<'\n';
for(i=1;i<=maxx;i++)
fout<<t[i]<<" ";
return 0;
}
