Cod sursa(job #1527455)
| Utilizator | Data | 18 noiembrie 2015 08:40:35 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[100001],n,i,j,l[100001];
int main()
{
f>>n;
int max1=0;
int indi=0;
for(int i=1;i<=n;i++)
f>>a[i];
l[n]=1;
for(int i=n-1;i>=1;i--)
{
for(int j=i+1;j<=n;j++)
if(a[i]<a[j]&&l[j]>=l[i])
l[i]=l[j]+1;
if(l[i]>max1)
{max1=l[i];
indi=i;
}
}
g<<max1<<"\n";
for(int i=indi;i<=n;i++)
if(l[i]==max1)
{
g<<a[i]<<" ";
max1--;
}
return 0;
}
