Cod sursa(job #485401)
| Utilizator | Data | 18 septembrie 2010 11:52:13 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.08 kb |
#include <cstdio>
using namespace std;
int a[100020],n,Lpoz[100020],Li[100020];
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for (int i=0;i<n;i++)
scanf("%d",&a[i]);
for (int i=0;i<n;i++)
{
Lpoz[i]=-1;
Li[i]=1;
}
int lmax=0,llpoz;
for (int i=n-2;i>=0;i--)
{
int j=i+1;
while(j<n)
{
if(a[i]<a[j])
{
if(Li[i]<Li[j]+1)
{
Li[i] = Li[j] + 1;
Lpoz[i] = j;
} }
j++;
}
}
for (int i=0;i<n;i++)
{
if(lmax<Li[i])
{
lmax=Li[i];
llpoz=i;
}
}
printf("%d\n",lmax);
for (int i=0;i<lmax;i++)
{
printf("%d ",a[llpoz]);
llpoz=Lpoz[llpoz];
}
return 0;
}
