Cod sursa(job #884624)
| Utilizator | Data | 21 februarie 2013 09:24:40 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int p, n, i,j, maxim;
long long a[100001],l[100001], poz[100001];
int main()
{
cin>>n;
maxim=1;
poz[n]=-1;
l[n]=1; p=n;
for(i=1;i<=n;++i)
cin>>a[i];
for(i=n;i>=1;--i)
{ poz[i]=-1;
l[i]=1;
for(j=n;j>i;--j)
if(a[i]<a[j] && l[i]<l[j]+1)
{ l[i]=l[j]+1;
poz[i]=j;
if(l[i]>maxim)
maxim=l[i], p=i; }}
cout<<maxim<<"\n";
i=p;
while(i!=-1)
{ cout<<a[i]<<" ";
i=poz[i];}
cout<<"\n";
return 0; }
