Cod sursa(job #2458689)
| Utilizator | Data | 21 septembrie 2019 12:22:02 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n,v[50],l[50],pred[50],lmax;
void subsir(int p){
if(pred[p]!=0){
subsir(pred[p]);
}
out<<v[p]<<' ';
}
int main(){
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
int imax=1;
for(int i=1;i<=n;i++){
for(int j=1;j<i;j++){
if(v[j]<v[i]){
if(l[j]>l[i]){
l[i]=l[j];
pred[i]=j;
}
}
}
l[i]++;
if(l[i]>l[imax])
imax=i;
}
out<<l[imax]<<'\n';
subsir(imax);
return 0;
}
