Cod sursa(job #2068192)
| Utilizator | Data | 17 noiembrie 2017 12:46:07 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long long int a[100005],l[100005];
int n,i,j;
int Lmax,L;
int Max;
int p;
long long int ult;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
l[n]=1;
for(i=n; i>=1; i--)
{
Max=0;
for(j=i+1; j<=n; j++)
if(a[i]<a[j]&&Max<l[j])
Max=l[j];
l[i]=Max+1;
if(Lmax<l[i])
{
Lmax=l[i];
p=i;
}
}
g<<Lmax<<'\n';
ult=a[p]-1;
for(i=p; i<=n; i++)
if(a[i]>ult&&l[i]==Lmax)
{
g<<a[i]<<' ';
ult=a[i];
Lmax--;
}
return 0;
}
