Submission #949970

#TimeUsernameProblemLanguageResultExecution timeMemory
949970vjudge1Rabbit Carrot (LMIO19_triusis)C++17
100 / 100
26 ms5188 KiB
#include <vector> #include <string> #include <algorithm> #include <iostream> using namespace std; using ll = int64_t; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<int> a(n); for (int& x : a) cin >> x; vector<ll> v; for (ll i = 0, x; i < n; i++) { x = 1LL * m * (i + 1) - a[i]; // b[i] if (x < 0) continue; if (v.empty() or x >= v.back()) v.push_back(x); else *lower_bound(v.begin(), v.end(), x + 1) = x; } cout << n - v.size() << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...