제출 #739773

#제출 시각아이디문제언어결과실행 시간메모리
739773Dead_Inside7Rabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,k;cin>>n>>k; vector<int> arr(n); for(auto&v:arr) cin>>v; int ans=0; vector<int> dp; if(k<arr[0]){ ans++; arr[0]=k; } dp.push_back(arr[0]); for(int j=1;j<n;j++){ if(arr[j]>(dp.back() + k)) ans++; dp.push_back(min(dp.back() + k,arr[j])); } cout<<ans<<endl; 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...