제출 #1193451

#제출 시각아이디문제언어결과실행 시간메모리
1193451PakinDioxideRabbit Carrot (LMIO19_triusis)C++17
100 / 100
53 ms1472 KiB
#include <bits/stdc++.h>
#define ll long long

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector <int> d;
    d.emplace_back(0);
    for (int i = 1; i <= n; i++) {
        int e; cin >> e; e -= i*k; e = -e;
        int idx = upper_bound(d.begin(), d.end(), e) - d.begin();
        if (idx == (int) d.size()) d.emplace_back(e);
        else if (idx != 0) d[idx] = e;
    }
    cout << n + 1 - (int) d.size() << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...