# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1069252 | n1k | Sjeckanje (COCI21_sjeckanje) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#if defined(LOCAL)
#include "debug.cpp"
#else
#define debug(x...) 0
#endif // LOCAL
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
void solve(){
int n, q; cin >> n >> q;
vector<ll> a(n);
for(int i=0; i<n; i++) cin >> a[i];
auto get = [&](vector<ll> a){
debug(a);
ll ans = 0;
for(int i=0, j; i<n; i++){
for(j=i; j<n-1 and a[i]<a[i+1] == a[j]<a[j+1]; j++){
}
if(a[j-1]==a[j]) j--;
if(j==n-2) j++;
ans+=abs(a[i]-a[j]);
debug(i, j, a[j-1], a[j]);
i=j;
}
return ans;
};
while(q--){
ll l, r, add;
cin>>l>>r>>add;
l--, r--;
for(int i=l; i<=r;i++) a[i]+=add;
cout<<get(a)<<endl;
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int t=1; //cin >> t;
while(t--) solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |