제출 #1228978

#제출 시각아이디문제언어결과실행 시간메모리
1228978haiduongRabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms328 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define fi first #define se second int const N=5e5+10; int a[N]; int sum[N]; int ma=-1000000000; int res=0; signed main() { cin.tie(0)->sync_with_stdio(false); int n,k; cin>>n>>k; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=0;i<=n;i++){ if(a[i+1]-a[i]>k){ res++; a[i+1]-=k; } } cout<<res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...