Cod sursa(job #1705275)
| Utilizator | Data | 20 mai 2016 11:11:59 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
int n,a[100001],i,j,lmax,l[100001],ma,u,poz;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n; ma=0;
for(i=1;i<=n;i++)
f>>a[i];
l[n]=1;
for(i=n-1;i>=1;i--)
{
lmax=0;
for(j=i+1;j<=n;j++)
if(a[i]<a[j] && l[j]>lmax)
lmax=l[j];
l[i]=lmax+1;
}
for(i=1;i<=n;i++)
if(lmax<l[i]){ lmax=l[i];
poz=i;}
u=0;
for(i=poz;i<=n;i++)
if(a[i]>u && l[i]==lmax)
{
g<<a[i]<<" ";
u=a[i];
lmax--;
}
return 0;
}
