제출 #675554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675554		brijeshSiwach	Bigger segments (IZhO19_segments)	C++17	0 / 100	0 ms	212 KiB

segments

#include <iostream>
#include <algorithm>

using namespace std;

// Function to find the minimum number of operations required to make the array non-decreasing
int minimumOperations(int arr[], int n) {
    int dp[n];
    for (int i = 1; i < n; i++) {
        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];
}

int main() {
    // Read the array from the user
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }

    // Print the result
    cout << minimumOperations(arr, n) << endl;

    return 0;
}

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