Cod sursa(job #1636597)
Utilizator | Gagea Eusebiu-Andrei eusebiu_gagea | Data | 7 martie 2016 11:02:13 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[100001],urm[100001],lg[100001];
int main()
{
int i,j,lgm=0,ind,im,lgmax;
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
urm[n]=0;
lg[n]=1;
for(i=n-1; i>=1; i--)
{
lgmax=0;
ind=0;
for(j=i+1; j<=n; j++)
if(v[i]<v[j] && lg[j]>lgmax)
{
lgmax=lg[j];
ind=j;
}
lg[i]=lgmax+1;
urm[i]=ind;
if(lg[i]>lgm)
{
lgm=lg[i];
im=i;
}
}
g<<lgm<<'\n';
do{
g<<v[im]<<' ';
im=urm[im];
}while(lg[im]>0);
return 0;
}