| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1352961 | ElayV13 | Sjeckanje (COCI21_sjeckanje) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
const int INF=1e18;
void solve(){
int n,q;
cin>>n>>q;
vector<int>a(n);
for(int i=0;i<n;i++) cin>>a[i];
while(q--){
int l,r,x;
cin>>l>>r>>x;
--l;
--r;
for(int i=l;i<=r;i++) a[i]+=x;
int v1=*max_element(a.begin(),a.end());
int v2=*min_element(a.begin(),a.end());
bool f1=0,f2=0;
int res=0;
for(int i=0;i<n;i++){
if(a[i]==v1) f1=1;
if(a[i]==v2) f2=1;
if(f1&&f2){
res+=(v1-v2);
f1=f2=0;
}
}
cout<<res<<'\n';
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T=1;//cin>>T;
while(T--) solve();
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
