Submission #528894

#TimeUsernameProblemLanguageResultExecution timeMemory
528894DragosC1Rabbit Carrot (LMIO19_triusis)C++17
100 / 100
27 ms3700 KiB
#include <iostream> using namespace std; #define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); int a[200001], lung; int b[200001], l; int main() { fast int i, n, m, x, st, dr, mij; cin >> n >> m; for (i = 1; i <= n; i++) { cin >> x; if (x <= i * m) a[++lung] = i * m - x; } for (i = 1; i <= lung; i++) if (l == 0 || a[i] >= b[l]) b[++l] = a[i]; else { st = 1, dr = l; while (st <= dr) { mij = (st + dr) / 2; if (b[mij] > a[i]) dr = mij - 1; else st = mij + 1; } b[st] = a[i]; } cout << n - l; 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...