Mai intai trebuie sa te autentifici.
Cod sursa(job #2058978)
Utilizator | Data | 6 noiembrie 2017 15:27:55 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.78 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],k,v[100001];
void afis(int i, int u, int lmax)
{
if(i>=1)
if(a[i]<u&&l[i]==lmax)
{
afis(i-1,a[i],lmax-1);
g<<a[i]<<" ";
}
else afis(i-1,u,lmax);
}
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
l[1]=1;
p=1;
lmax=1;
for(i=2; i<=n; i++)
{
ma=0;
for(j=1; j<=i-1; 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;
afis(p, a[p]+1,lmax);
return 0;
}