Pagini recente » Cod sursa (job #2366808) | Cod sursa (job #1399307) | Cod sursa (job #408007) | Cod sursa (job #2729462) | Cod sursa (job #2559409)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
long long a[1010];
long long n, mxx = 0, poz = 0;
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1; i <= n; i++) {
long long t = a[i], k = a[i];
//cout<<"i-1"<<'\n';
//cout<<" t: "<<t<<" k: "<<k<<'\n';
for(int j = i - 1; j > 0; j--){
if(a[j] <= k){
t += a[j];
k = a[j];
//cout<<"i: "<<i <<" j: "<<j<< " a[i]: "<< a[i]<< " a[j]: "<< a[j]<<" t: "<<t<<" k: "<<k<<'\n';
}
else{
t += k;
//cout<<"i: "<<i <<" j: "<<j<< " a[i]: "<< a[i]<< " a[j]: "<< a[j]<<" t: "<<t<<" k: "<<k<<'\n';
}
}
k = a[i];
//cout<<"i+1"<<'\n';
//cout<<" t: "<<t<<" k: "<<k<<'\n';
for(int j = i + 1; j <= n; j++) {
if(a[j] <= k){
t += a[j];
k = a[j];
//cout<<"i: "<<i <<" j: "<<j<< " a[i]: "<< a[i]<< " a[j]: "<< a[j]<<" t: "<<t<<" k: "<<k<<'\n';
}
else{
t += k;
//cout<<"i: "<<i <<" j: "<<j<< " a[i]: "<< a[i]<< " a[j]: "<< a[j]<<" t: "<<t<<" k: "<<k<<'\n';
}
}
if(mxx < t){
mxx = t; poz = i;
//cout<<"mxx: "<<mxx<<" poz: "<<poz<<'\n';
}
}
long long mij = a[poz];
for(int i = poz - 1; i > 0; i--) {
if(a[i] > mij)
a[i] = mij;
else
mij = a[i];
}
mij = a[poz];
for(int i = poz + 1; i <= n; i++) {
if(a[i] > mij)
a[i] = mij;
else
mij = a[i];
}
for(int i = 1; i <= n; i++)
cout << a[i] << " ";
return 0;
}