Cod sursa(job #1802691)
Utilizator | Data | 10 noiembrie 2016 16:24:58 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
using namespace std;
ifstream fi("scmax.in");
ofstream fo("scmax.out");
int n,i,j,k,s,a[100005],b[100005],maxi;
int poz,v[100005];
int main()
{
fi>>n;
for(i=1;i<=n;i++)
fi>>a[i];
b[i]=1;
for(i=2;i<=n;i++){
k=0;
for(j=1;j<=i-1;j++){
if(a[j]<a[i])k++;
}
b[i]=k;
}
for(i=1;i<=n;i++){
if(b[i]>maxi){maxi=b[i];poz=i;}
}
v[++k]=a[poz];
maxi=a[poz];
for(i=poz-1;i>=1;i--){
if(a[i]<maxi){
v[++k]=a[i];
maxi=a[i];
}
}
for(i=k;i>=1;i--){
if(v[i]!=0)fo<<v[i]<<' ';
else break;
}
return 0;
}