Cod sursa(job #2118309)
| Utilizator | Data | 30 ianuarie 2018 14:40:27 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,m,mx=0,v[100001],a[1000001],b[1001][1001];
int main()
{
int i,j;
cin>>n;
for(i=1;i<=n;i++)
{
mx=0;
cin>>v[i];
for(j=1;j<i;j++)
{
if(v[i]>v[j])
{
mx=max(mx,a[j]);
b[i][mx]=v[j];
}
}
a[i]=1+mx;
b[i][a[i]]=v[i];
}
fout<<a[n]<<endl;
for(i=1;i<=a[n];i++)
{
fout<<b[n][i]<<" ";
}
return 0;
}
