Submission #1229007

#TimeUsernameProblemLanguageResultExecution timeMemory
1229007haiduongRabbit 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]; } a[0]=0; for(int i=0;i<=n;i++){ if(abs(a[i+1]-a[i])>k){ if(a[i+1]>a[i]){ a[i+1]=a[i]+k; } else a[i+1]=a[i]-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...