Cod sursa(job #2251118)
| Utilizator | Data | 1 octombrie 2018 09:55:32 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n,i,j,v[100001],sol[100001],nr,nrmax,solmax[100001];
int main()
{
nrmax=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=1;i<=n;i++)
{
nr=1;
sol[nr]=v[i];
for(j=i+1;j<=n;j++)
if(v[j]>sol[nr])
{
nr++;
sol[nr]=v[j];
}
if(nr>nrmax)
{
nrmax=nr;
for(j=1;j<=nrmax;j++)
solmax[j]=sol[j];
}
}
cout<<nrmax<<"\n";
for(i=1;i<=nrmax;i++)
cout<<solmax[i]<<" ";
return 0;
}
