Submission #675547

#	Time	Username	Problem	Language	Result	Execution time	Memory
675547		brijeshSiwach	Bigger segments (IZhO19_segments)	Cpython 3	0 / 100	12 ms	2772 KiB

segments

def minimumOperations(arr):
    n = len(arr)
    dp = [0] * n
    for i in range(1, n):
        if arr[i] >= arr[i-1]:
            dp[i] = dp[i-1]
        else:
            dp[i] = min(dp[i-2] + 1, dp[i-3] + 1)
    return dp[n-1]
 
n=input()
arr=list(map(int,input().split()))
print(minimumOperations(arr))

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27