Cod sursa(job #309285)
| Utilizator | Data | 29 aprilie 2009 23:14:17 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream.h>
long l[100003],v[100003],i,n,k,t,max,nr,m;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
for(k=n-1;k>=1;k--)
{
max=0;
for(i=k+1;i<=n;i++)
if(v[i]>=v[k]&&l[i]>=max)
max=l[i];
l[k]=1+max;
}
max=l[1];
t=1;
for(i=1;i<=n;i++)
if(l[i]>max)
{
max=l[i];
t=i;
}
g<<max<<"\n";
g<<v[t]<<" ";
for(i=t+1;i<=n;i++)
if(v[i]>=v[t]&&l[i]==max-1)
{
g<<v[i]<<" ";
max--;
}
return 0;
}
