Cod sursa(job #409623)
| Utilizator | Data | 3 martie 2010 19:33:05 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
int main()
{
int x,max,i,j,n,a[1000],l[1000];
fstream fi("scmax.in",ios::in);
fstream fo("scmax.out",ios::out);
fi>>n;
for(i=1;i<=n;i++)
fi>>a[i];
l[n]=1;
for(i=n-1;i>=1;i--)
{
l[i]=1;
for(j=n;j>=i+1;j--)
if((l[i]<l[j]+1)&&(a[j]>a[i])) l[i]=l[j]+1;
}
max=-int(2e9);
for(i=1;i<=n;i++)
if(max<l[i]) max=l[i];
fo<<max<<"\n";
x=0;
for(i=1;i<=n;i++)
if((x<a[i])&(l[i]==max)){ fo<<a[i]<<" "; max--; x=a[i];}
fo.close();
return 0;
}