Submission #1083911

#TimeUsernameProblemLanguageResultExecution timeMemory
1083911duytuandao21Sjeckanje (COCI21_sjeckanje)C++17
0 / 110
7 ms348 KiB
#include<bits/stdc++.h> using namespace std; const int N = 2e6 + 7; const int inf = 1e9 + 7; const long long infll = 1e18 + 7; typedef pair< float, int > ii; int n, q; long long a[N]; long long GetResult() { vector<long long> dp(n + 1, 0); long long res = -infll; for (int i = 1; i <= n; i++) { long long maxValue = -inf; long long minValue = inf; for (int j = i; j > 0; j--) { maxValue = max(maxValue, a[j]); minValue = min(minValue, a[j]); dp[i] = max(dp[i], dp[j - 1] + maxValue - minValue); res = max(res, dp[i]); } // cout << dp[i] << ' '; } return res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> q; for (int i = 1; i <= n; i++) cin >> a[i]; while (q--) { int l, r; long long v; cin >> l >> r >> v; for (int i = l; i <= r; i++) a[i] += v; cout << GetResult(); if (q > 0) cout << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...