Submission #1304652

#TimeUsernameProblemLanguageResultExecution timeMemory
1304652joeyao67Rabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms572 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N; long long M; cin >> N >> M; vector<long long> dp; dp.reserve(N); for (int i = 1; i <= N; i++) { long long a; cin >> a; long long b = a - i * M; int l = 0, r = (int)dp.size(); while (l < r) { int mid = (l + r) / 2; if (dp[mid] < b) r = mid; else l = mid + 1; } if (l == (int)dp.size()) dp.push_back(b); else dp[l] = b; } cout << N - (int)dp.size() << "\n"; 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...