Submission #3046288

---

Source Code Expand

n = int(input())
a = list(map(int, input().split()))

# 絶対値の差列をとる
diff = [a[i+1] - a[i] for i in range(n-1)]

# max,minをパレットに格納
max_a = max(a)
max_a_id = a.index(max_a)
min_a = min(a)
min_a_id = a.index(min_a)

path_plus = []
if not all([ai < 0 for ai in a]):
    # maxを足していく方針
    i = 0
    while any([d < 0 for d in diff]):
        if diff[i] >= 0:
            i += 1
            continue
        
        elif i == n-2:
            diff[i] += max_a
            path_plus.append(( max_a_id+1, i+2))
            
        else:
            diff[i] += max_a
            a[i] += max_a
            diff[i+1] -= max_a
            
            max_a = max(max_a, a[i])
            
            path_plus.append(( max_a_id+1, i+2))

path_minus = []        
if not all([ai > 0 for ai in a]):
    # minを引いていく方針
    i = n-2
    while any([d < 0 for d in diff]):
        if diff[i] >= 0:
            i -= 1
            continue
        
        elif i == 0:
            diff[i] -= min_a
            path_minus.append((min_a_id+1, i+1))
            
        else:
            diff[i] -= min_a
            a[i] += min_a
            diff[i-1] += min_a
            
            min_a = min(min_a, a[i])
            
            path_minus.append(( min_a_id+1, i+1))
       
if (len(path_plus) > 0) and (len(path_plus) <= 2*n):
    print(len(path_plus))
    for x,y in path_plus:
        print(x,y)
        
elif (len(path_minus) > 0) and (len(path_minus) <= 2*n):
    print(len(path_minus))
    for x,y in path_minus:
        print(x,y)
        
else:
    print(0)

Submission Info

Judge Result