Submission #1168224

#TimeUsernameProblemLanguageResultExecution timeMemory
1168224PlayVoltzSjeckanje (COCI21_sjeckanje)C++20
0 / 110
0 ms320 KiB
#include <cstdio> #include <stdio.h> #include <stdbool.h> #include <iostream> #include <map> #include <vector> #include <climits> #include <stack> #include <string> #include <queue> #include <algorithm> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cctype> #include <bitset> #include <iomanip> #include <cstring> #include <numeric> #include <cassert> using namespace std; #define int long long #define pii pair<int, int> #define mp make_pair #define pb push_back #define fi first #define se second int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, q, a, b, c; cin>>n>>q; vector<int> vect(n+1, 0), d(n, 0); for (int i=1; i<=n; ++i)cin>>vect[i], d[i-1]=vect[i]-vect[i-1]; while (q--){ cin>>a>>b>>c; d[b]-=c; d[a-1]+=c; vector<int> dp(n+1, 0); dp[0]=dp[1]=0; for (int i=2; i<=n; ++i)dp[i]=max(dp[i-1], dp[i-2]+abs(d[i-1])); cout<<dp[n]<<"\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...