Cod sursa(job #257770)
| Utilizator | Data | 13 februarie 2009 22:25:31 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream.h>
int v[201],l[201],u[201];
int main()
{
int n,i,j,p,c;
ifstream in("scmax.in");
ofstream out("scmax.out");
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
for(i=n;i>=1;i--)
{
j=i+1;
c=0;
p=0;
while(j<=n)
{
if(v[j]>v[i]&&l[j]>c)
{
c=l[j];
p=j;
}
j++;
}
l[i]=1+c;
u[i]=p;
}
for(i=1;i<=n;i++)
{
if(l[i]>c)
{
c=l[i];
p=i;
}
}
out<<c<<'\n';
i=p;
while(i!=0)
{
out<<v[i]<<" ";
i=u[i];
}
in.close();
out.close();
return 0;
}