# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1113322 | kiethm07 | Sjeckanje (COCI21_sjeckanje) | C++11 | 2057 ms | 8896 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 pii pair<int,int>
#define pli pair<long long,pii>
#define fi first
#define se second
#define vi vector<int>
#define vii vector<pii>
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
const int inf = 1e9;
const ll linf = 1e16;
const double pi = acos(-1);
const int N = 2e5 + 5;
ll a[N];
ll d[N];
ll dp[N][2];
int n,q;
ll brute(){
dp[0][0] = dp[0][1] = 0;
dp[1][0] = dp[1][1] = 0;
if (d[1] > 0) dp[1][0] = d[1];
else dp[1][1] = -d[1];
for (int i = 2; i < n; i++){
dp[i][0] = dp[i - 1][0];
dp[i][1] = dp[i - 1][1];
if (d[i] > 0){
dp[i][0] = max(dp[i][0], dp[i - 1][0] + d[i]);
dp[i][0] = max(dp[i][0], max(dp[i - 2][0], dp[i - 2][1]) + d[i]);
}
else{
dp[i][1] = max(dp[i][1], dp[i - 1][1] - d[i]);
dp[i][1] = max(dp[i][1], max(dp[i - 2][0], dp[i - 2][1]) - d[i]);
}
}
return max(dp[n - 1][0], dp[n - 1][1]);
}
void solve(){
while(q--){
int l,r,x;
cin >> l >> r >> x;
d[l - 1] += x;
d[r] -= x;
cout << brute() << "\n";
}
}
int main(){-
#define TEXT "a"
cin.tie(0) -> sync_with_stdio(0);
if (fopen(TEXT".inp","r")){
freopen(TEXT".inp","r",stdin);
freopen(TEXT".out","w",stdout);
}
cin >> n >> q;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
for (int i = 1; i < n; i++) d[i] = a[i + 1] - a[i];
solve();
return 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... |