Submission #942492

#TimeUsernameProblemLanguageResultExecution timeMemory
942492sheldonRabbit Carrot (LMIO19_triusis)C++14
100 / 100
20 ms3112 KiB
#include <bits/stdc++.h> using namespace std; void solve() { int n, m; cin >> n >> m; vector<int> dp; for (int i = 1; i <= n; ++i) { int x; cin >> x; if (m * i < x) { continue; } int val = m * i - x; auto it = upper_bound (dp.begin(), dp.end(), val); if (it == dp.end()) { dp.push_back(val); } else { *it = val; } } cout << n - dp.size(); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...