Cod sursa(job #1437699)
| Utilizator | Data | 18 mai 2015 12:01:27 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, k,vmax ,a, v[100001], x[100001], pos[100001];
int main()
{
fin>>n;
for(int i=1;i<=n;i++) fin>>v[i];
x[n]=1;
k=n;
pos[n]=n+1;
for(int i=n-1;i;i--)
{ int xmax=0;
a=i;
for(int j=i+1;j<=n;j++)
if(v[j]>v[i] && xmax<x[j]) {xmax=x[j];a=j;}
x[i]=1+xmax;
pos[i]=a;
if(x[k]<x[i]) k=i;
}
fout<<x[k]<<'\n';
int j=k;
while(pos[j]!=0)
{ fout<<v[j]<<" ";
j=pos[j];
}
fout.close();
return 0;
}
