제출 #695295

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
695295		stevancv	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	4 ms	4992 KiB

triusis

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 2e5 + 2;
const int inf = 2e9;
int a[N], l[N], r[N], dp[N];
vector<int> g[N];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] -= k * i;
    }
    a[n + 1] = -inf;
    stack<int> s;
    for (int i = 0; i <= n + 1; i++) {
        while (!s.empty() && a[s.top()] < a[i]) s.pop();
        if (!s.empty()) l[i] = s.top();
        else l[i] = -1;
        s.push(i);
    }
    while (!s.empty()) s.pop();
    for (int i = n + 1; i >= 0; i--) {
        while (!s.empty() && a[s.top()] > a[i]) s.pop();
        if (!s.empty()) r[i] = s.top();
        else r[i] = -1;
        s.push(i);
    }
    for (int i = 0; i <= n + 1; i++) {
        if (l[i] != -1) g[i].push_back(l[i]);
        if (r[i] != -1) g[r[i]].push_back(i);
    }
    for (int i = 1; i <= n + 1; i++) {
        dp[i] = i;
        for (int j : g[i]) smin(dp[i], dp[j] + i - j - 1);
    }
    cout << dp[n + 1] << en;
    return 0;
}

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