Submission #641788

#TimeUsernameProblemLanguageResultExecution timeMemory
641788HaYoungJoonRabbit Carrot (LMIO19_triusis)C++14
100 / 100
29 ms5348 KiB
#include <bits/stdc++.h>
#define ll long long
#define INF 1e18
using namespace std;

const int maxn = 2e5 + 1;
int n;
ll M, a[maxn], dp[maxn];

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> M;
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        if (x <= M*i) a[++cnt] = M*i - x;
    }
    int res = 0;
    for (int i = 1; i <= cnt; i++) {
        int id = upper_bound(dp,dp+res,a[i]) - dp;
        if (a[i] != INF) res = max(res,id+1);
        dp[id] = a[i];
    }
    cout << n - res;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...