Submission #501156

#	Time	Username	Problem	Language	Result	Execution time	Memory
501156		MrVroom999	Nizin (COCI16_nizin)	Cpython 3	100 / 100	836 ms	30512 KiB

nizin

"""
COCI 2016/2017 Round 2
Given an array of integers [a1, a2, ... an]
perform an operation that combines a1 and a2
or combines an and an-1
Find minimum operations such that array is
a palindrome
"""

N = int(input())
arr = list(map(int, input().split()))
k, i, j = 0, 0, N - 1
while i < j:
    if arr[i] == arr[j]:
        i += 1
        j -= 1
    elif arr[i] < arr[j]:
        arr[i + 1] += arr[i]
        i += 1
        k += 1
    else:
        arr[j - 1] += arr[j]
        j -= 1
        k += 1
print(k)

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10