Submission #376492

#TimeUsernameProblemLanguageResultExecution timeMemory
376492gustasonRabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms364 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<int> a(n+1); a[0] = 0; for(int i = 1; i <= n; i++) { cin >> a[i]; } int best = n+1; int ans = 0; for(int i = 1; i <= n; i++) { if (a[i] - a[i-1] > m) { a[i] = a[i-1] + m; ans++; } } best = ans; ans = 0; reverse(a.begin(), a.end()); for(int i = 0; i < n; i++) { if (a[i-1] - a[i] > m) { a[i] = a[i-1] - m; ans++; } } cout << min(best, ans); 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...