oj.uz

Submission #675554

# Submission time Handle Problem Language Result Execution time Memory
675554 2022-12-27T12:33:59 Z brijeshSiwach Bigger segments (IZhO19_segments) C++17
0 / 100
 0 ms 212 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -