제출 #1152666

#제출 시각아이디문제언어결과실행 시간메모리
1152666i271828Sjeckanje (COCI21_sjeckanje)C++20
0 / 110
1 ms320 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; const int MAX=200005; int N=4, Q=3; ll A[MAX]={1,2,3,4}; ll A2[MAX]; ll ans; int main(){ //ios_base::sync_with_stdio(false);cin.tie(NULL); cin>>N>>Q; for (int i=0;i<N;i++) cin>>A[i]; for (int q=0;q<Q;q++){ int l,r,x; cin>>l>>r>>x; l--,r--; for (int i=l;i<=r;i++) A[i]+=x; vector<int> points; for (int i=1;i<N-1;i++){ if ((min(A[i],min(A[i-1],A[i+1]))==A[i])||(max(A[i],max(A[i-1],A[i+1]))==A[i])){ points.push_back(i); } } ans=0; for (int i=0;i<N-1;i++) ans+=abs(A[i]-A[i+1]); for (int i=0;i<points.size();i++){ int x=points[i]; ans-=min(abs(A[x]-A[x-1]),abs(A[x]-A[x+1])); } cout<<ans<<'\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...