Submission #971901

#TimeUsernameProblemLanguageResultExecution timeMemory
971901kfhjadRabbit Carrot (LMIO19_triusis)C++17
100 / 100
21 ms4312 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { cin.tie(NULL) -> sync_with_stdio(false); int N, M; cin >> N >> M; vector<int> v(N); for (auto& i : v) cin >> i; vector<int> dp; for (int i = 0; i < N; ++i) { int x = M * (i + 1) - v[i]; if (x < 0) continue; auto it = upper_bound(dp.begin(), dp.end(), x); if (it == dp.end()) dp.push_back(x); else *it = x; } cout << N - dp.size() << endl; 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...