Cod sursa(job #1711829)
| Utilizator | Data | 1 iunie 2016 11:37:39 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream in ("scmax.in");
ofstream out ("scmax.out");
int a[100001],i,j,n,nr,l[100001],maxi,poz;
int main()
{
in>>n;
for(i=1; i<=n; i++)
in>>a[i];
int maxg=0; l[n]=1;
for(i=n-1; i>=1; i--)
{
maxi=0;
for(j=i+1; j<=n; j++)
{
if(a[i]<a[j] && l[j]>maxi) maxi=l[j];
}
l[i]=maxi+1;
if(l[i]>maxg) {maxg=l[i]; poz=i;}
}
out<<maxg<<endl;
for(i=1; i<=n; i++)
if(l[i]==maxg) {out<<a[i]<<" "; maxg--;}
return 0;
}
