Cod sursa(job #1152285)
Utilizator | Data | 24 martie 2014 17:20:01 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,nr=0,L[100000],Lm;
long a[100000];
void dinamica() {
int i,j,maxim;
L[n]=1;
for(i=n-1;i>=1;i--) {
maxim=0;
for(j=i+1;j<=n;j++)
if(L[j]>maxim&&a[i]<=a[j]) maxim=L[j];
L[i]=maxim+1;
if(Lm<L[i]) Lm=L[i];
}
}
void drum() {int i;
for(i=1;i<=n;i++) if(L[i]==Lm) {
g<<a[i]<<" ";
Lm--;
}
}
int main()
{int i;
f>>n;
for(i=1;i<=n;i++) f>>a[i];
dinamica();
drum();
}