Cod sursa(job #1916877)
Utilizator | Data | 9 martie 2017 10:34:30 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.81 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,a[100002],lmax[100002],maxmax;
int main()
{
f>>n;
for(int i=0; i<n; i++)
f>>a[i];
lmax[n-1]=1;
for(int i=n-2; i>=0; i--)
{
int nrmax=1,aux=a[i];
for(int j=i+1; j<n; j++)
if(a[j]>aux)
{
nrmax++;
aux=a[j];
}
lmax[i]=nrmax;
if(lmax[i]>maxmax)
maxmax=lmax[i];
}
g<<maxmax<<'\n';
int aux=0;
for(int i=0; i<n; i++)
{
if(a[i]>aux)
if(lmax[i]==maxmax)
{
g<<a[i]<<' ';
maxmax--;
aux=a[i];
}
}
return 0;
}