제출 #714914

#제출 시각아이디문제언어결과실행 시간메모리
714914MilosMilutinovicRabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms316 KiB
#include <bits/stdc++.h>

using i64 = long long;

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

    int n, m;
    std::cin >> n >> m;

    n += 1;
    std::vector<int> a(n);
    for (int i = 1; i < n; i++) {
        std::cin >> a[i];
        a[i] -= i * m;
    }
    int ans = 1;
    int h = 0;
    for (int i = 1; i < n; i++) {
        if (a[i] <= h) {
            h = a[i];
            ans += 1;
        }
    }

    std::cout << n - ans << "\n";

    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...