Submission #1229095

#TimeUsernameProblemLanguageResultExecution timeMemory
1229095buixuiaRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms1220 KiB
#include<bits/stdc++.h> using namespace std; int n, m, a[200005], dp[200005]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); cin>>n>>m; for(int i = 1; i <= n; i++) cin>>a[i]; memset(dp, 0x3f, sizeof(dp)); dp[0] = 0; int h = 0; for(int i = 1; i <= n; i++){ if(a[i] - h <= m){ dp[i] = dp[i-1]; h = a[i]; } else{ int up = dp[i-1] + 1; int down = dp[i-1] + 1; dp[i] = min(up, down); h += m; } } cout<<dp[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...