Submission #616146

---

Source Code Expand

from Queue import * # Queue, LifoQueue, PriorityQueue
from bisect import * #bisect, insort
from collections import * #deque, Counter,OrderedDict,defaultdict
#set([]) 
import math
import copy
import itertools
import string
import sys
myread = lambda : map(int,raw_input().split())
def solver():
    
    N = int(raw_input())
    nums = myread()
    ans = [-1 for _ in xrange(N)]
    indx = []
    minv = min(nums)
    for i in xrange(len(nums)):
        if nums[i] == minv:
            indx.append(i)
    for x in indx:
        ans[x] = minv
        ans[x+1] = minv
    change = False
    for i in xrange(len(nums)):
        if not(change):
            if ans[i] == -1:
                ans[i] = nums[i]
            else:
                chnage = True
                ans[i+1] = nums[i]
        else:
            if nums[i] != minv:
                ans[i+1] = nums[i]
    for i in xrange(len(ans)):
        print ans[i],
    print


if __name__ == "__main__":
    solver()
    

Submission Info

Judge Result