Submission #1986174

---

Source Code Expand

n = int(input())
arr = list(map(int, input().split()))
import math
def findoptimal(diff):
    optimal = 0
    idx = -1
    passed = False

    for i in range(n):
        a = arr[i]
        if passed:
            if abs(a) < optimal:
                optimal = abs(a)
                idx = i
        else:
            if abs(a) > abs(diff):
                passed = True
                optimal = abs(a)
                idx = i
            else:
                if abs(a) > optimal:
                    optimal = abs(a)
                    idx = i

    if passed == False:
        c = math.ceil(abs(diff) / optimal)
    else:
        c = 1

    return c, idx, arr[idx]

def solve():
    ope = []
    for i in range(n-1):
        diff = arr[i+1] - arr[i]
        if diff >= 0:
            continue
        else:
            c, idx, res = findoptimal(diff)
            if res < 0:
                for j in range(c):
                    ope.append([idx, i])
                    arr[i] += res
            else:
                for j in range(c):
                    ope.append([idx, i+1])
                    arr[i+1] += res

    print(len(ope))
    for i in range(len(ope)):
        print(ope[i][0]+1, ope[i][1]+1)
    # print(ope)
    # print(arr)

solve()

Submission Info

Judge Result