Submission #1200030

#	Time	Username	Problem	Language	Result	Execution time	Memory
1200030		euclid	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	21 ms	2652 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vl vector<ll>

int n, m;
const int MN = 2e5 + 7, INF = 1e9+7;
int b[MN], a[MN], dp[MN];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> b[i], a[i] = i*m-b[i];
    dp[0] = -INF;
    for(int i = 1; i <= n; i++) dp[i] = INF;
    for(int i = 1; i <= n; i++) {
        if(a[i] < 0) continue;
        int l = upper_bound(dp+1, dp+1+n, a[i])-dp;
        dp[l] = a[i];
    }
    int ans = 0;
    for(int i = 1; i <= n; i++) if(dp[i] != INF) ans = i;
    cout << n-ans << '\n';


}

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