Cod sursa(job #1800171)
| Utilizator | Data | 7 noiembrie 2016 15:00:47 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int n,a[100001],l[100001],i,j,aux,prim;
int main()
{f>>n;
for(i=1;i<=n;i++)
{f>>a[i];l[i]=1;}
for(i=n-1;i>0;i--)
{
for(j=i+1;j<=n;j++)
{
if(a[i]<a[j])
{
l[i]=l[j]+l[i];aux=max(aux,l[i]);
break;
}
}
}
for(i=1;i<=n;i++)
{
if(l[i]==aux)
{
prim=a[i];
g<<prim<<" ";
break;
}
}
aux--;
for(i=1;i<=n;i++)
{
if(l[i]==aux&&prim<=a[i])
{
g<<a[i]<<" ";
prim=a[i];
aux--;
}
}
return 0;
}
