제출 #1283659

#제출 시각아이디문제언어결과실행 시간메모리
1283659hccoderSjeckanje (COCI21_sjeckanje)C++20
15 / 110
2092 ms696 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, q; cin>>n>>q; vector<long long> a(n+1); for (int i = 1; i<=n; i++) cin>>a[i]; while(q--){ int l, r, x; cin>>l>>r>>x; for (int i = l; i<=r; i++) a[i]+=x; vector<long long> dp(n+1); for (int i = 1; i<=n; i++){ long long mina = a[i]; long long maxa = a[i]; for (int j = i-1; j>=0; j--){ dp[i] = max(dp[i], dp[j] + maxa - mina); mina = min(mina, a[j]); maxa = max(maxa, a[j]); } } cout<<dp[n]<<"\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...