oj.uz

답안 #679753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679753 2023-01-09T06:42:21 Z faribourz Sjeckanje (COCI21_sjeckanje) C++14
0 / 110
 9 ms 212 KB 
// Only GOD
// believe in yourself
// Nemidam Del Be In Darde Donya!
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define int ll
typedef long double ld;
typedef pair<int, int> pii;

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#define bit(x, y) ((x >> y)&1)
#define sz(x) (int)x.size()
#define kill(x) return cout << x << '\n', void()
#define KILL(x) return cout << x << '\n', 0
#define int ll
const int N = 2e5+100;
const int INF = 1e9+10;
int a[N];
int n;
int dp[N];
int32_t main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int q;
	cin >> n >> q;
	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;
		for(int i =1; i<=n; i++)
			dp[i] = 0;
		dp[1] = 0;
		dp[2] = abs(a[2] - a[1]);
		for(int i = 3; i <= n; i++){
			int mx = -INF, mn = INF;
			for(int j = i; j >= 0; j--){
				dp[i] = max({(mx - mn) + dp[j], dp[i], dp[j]});
				mx = max(mx, a[j]);
				mn = min(mn, a[j]);
			}
		}
		cout << dp[n] << '\n';
	}
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -