Submission #413720

#TimeUsernameProblemLanguageResultExecution timeMemory
413720duyanh1704Rabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms204 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int inf = 1e15 + 9; int n, m, res; int a[200005]; signed main(){ ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 1; i <= n; ++i){ int x; cin >> x; a[i] = m * i - x; } vector<int> f(n + 5, inf); f[0] = -inf; for (int i = 1; i <= n; ++i){ int k = upper_bound(f.begin(), f.end(), a[i]) - f.begin(); res = max(res, k); f[k] = a[i]; } cout << n - res << 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...