Submission #1171459

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171459		ov113	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	2 ms	332 KiB

triusis

#include <iostream>
#include <stack>
using namespace std;

int main() {
    int n, m; cin >> n >> m;
    
    int a[n+1];
    a[0] = 0;
    for (int i=1; i<=n; i++) {
        cin >> a[i];
        a[i] -= i*m;
    }

    int lmnis[n+1]; // length of minimum non-increasing sequence from [0,n]
    lmnis[0] = 1;
    int max_lmnis = 1;

    stack<int> last_ge;
    last_ge.push(0);

    for (int i=1; i<=n; i++) {
        while (a[last_ge.top()] < a[i]) {
            last_ge.pop();
        }
        
        lmnis[i] = lmnis[last_ge.top()] + 1;
        last_ge.push(i);

        max_lmnis = max(max_lmnis, lmnis[i]);
    }

    cout << (n+1) - max_lmnis << '\n';
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37