# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402135 | NintsiChkhaidze | Sjeckanje (COCI21_sjeckanje) | C++14 | 75 ms | 596 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define ll long long
#define int ll
using namespace std;
const int N = 3005;
ll a[N],dp[4][N];
main (){
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int n,m;
cin>>n>>m;
for (int i=1;i<=n;i++)
cin>>a[i];
while(m--){
int l,r,k;
cin>>l>>r>>k;
for (int i=l;i<=r;i++)
a[i] += k;
vector <int> v;
v.clear();
for (int i=2;i<=n;i++)
v.pb(a[i-1] - a[i]);
for (int i=0;i<v.size();i++){
bool q=0;
if (i && v[i]*v[i-1] < 0) q=1;
if (i) dp[0][i] = max(dp[0][i - 1],dp[1][i-1]);
if (!q) dp[1][i] = dp[0][i] + abs(v[i]);
else dp[1][i] = dp[0][i - 1] + abs(v[i]);
}
cout<<max(dp[0][v.size()-1],dp[1][v.size()-1])<<"\n";
for (int i=0;i<=n;i++)
dp[0][i] = dp[1][i] = 0;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |