min_max.cpp

#include <iostream>
using namespace std;

int* max_element(int *begin, int *end) {
    int *answer=begin;
    for (int *iter=begin;iter!=end; ++iter) { if (*iter>*answer) { answer=iter; } }
    return answer; }
    
int main() {
    size_t N; cin >> N; int nums[N]; for (size_t i=0; i < N; ++i) { cin>>nums[i]; }
    int *min=max_element(nums,nums+N); auto left=min, right=min; int soln[N];
    for (size_t size=1; size <= N; ++size) {
        int gap=size-(right-left+1);
        if ((left-gap<nums || *(left-gap)>=*min) && (right+gap>=nums+N || *(right+gap)>=*min)) { soln[size-1]=(*min); continue; }
        if ((right+gap>=nums+N || *(right+gap)>=*min) && left-gap>=nums) { min=left=left-gap; }
        if ((left-gap<nums || *(left-gap)>=*min) && right+gap<nums+N) { min=right=right+gap; }
        if ((left-gap<nums || *(left-gap)>=*min) || (right+gap>=nums+N || *(right+gap)>=*min)) { soln[size-1]=(*min); continue; }
        if ((left-gap>=nums) && (right+gap<nums+N)) { if (*(left-gap)>*(right+gap)) { left=min=left-gap; } else { right=min=right+gap; } }
        soln[size-1]=(*min); } 
    for (int num: soln) cout << num << " "; cout << endl;
    return 0; }