Cod sursa(job #2058939)
| Utilizator | Data | 6 noiembrie 2017 14:40:24 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,j,p,lmax,ma,u,a[100001],l[100001];
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
l[n]=1;
p=n;
lmax=1;
for(i=n-1; i>=1; i--)
{
ma=0;
for(j=i+1; j<=n; j++)
if(a[i]<a[j]&&l[j]>ma)
ma=l[j];
l[i]=1+ma;
if(l[i]>lmax)
{
lmax=l[i];
p=i;
}
}
g<<l[p]<<endl;
g<<a[p]<<" ";
lmax--;
u=a[p];
for(i=p+1; i<=n; i++)
if(l[i]==lmax && a[i]>u)
{
g<<a[i]<<" ";
u=a[i];
lmax--;
}
return 0;
}
