Submission #384830

#TimeUsernameProblemLanguageResultExecution timeMemory
384830ngpin04Rabbit Carrot (LMIO19_triusis)C++14
100 / 100
36 ms5356 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int N = 2e5 + 5; int a[N]; int n,m; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); //freopen("file.inp","r",stdin); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] -= i * m; a[i] = -a[i]; } vector <int> lis(n + 1, 1e18 + 1); lis[0] = -1e18; int res = 0; for (int i = 1; i <= n; i++) { if (a[i] < 0) continue; int len = upper_bound(lis.begin(), lis.end(), a[i]) - lis.begin(); lis[len] = a[i]; res = max(res, len); //cout << a[i] << "\n"; } cout << n - res; 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...