제출 #1051560

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1051560		alex_2008	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	100 / 100	357 ms	7344 KiB

foehn_phenomena

#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
ll h[N], a[N];
int main() {
	ll n, q, s, t;
	cin >> n >> q >> s >> t;
	for (int i = 0; i <= n; i++) {
		cin >> h[i];
	}
	ll cur_s = 0, cur_t = 0;
	for (int i = 1; i <= n; i++) {
		a[i] = h[i] - h[i - 1];
		if (a[i] > 0) cur_s += a[i];
		else cur_t += (-a[i]);
	}
	while (q--) {
		ll l, r, x;
		cin >> l >> r >> x;
		if (a[l] > 0) cur_s -= a[l];
		else cur_t -= (-a[l]);
		a[l] += x;
		if (a[l] > 0) cur_s += a[l];
		else cur_t += (-a[l]);
		if (r != n) {
			if (a[r + 1] > 0) cur_s -= a[r + 1];
			else cur_t -= (-a[r + 1]);
			a[r + 1] -= x;
			if (a[r + 1] > 0) cur_s += a[r + 1];
			else cur_t += (-a[r + 1]);
		}
		cout << cur_t * 1ll * t - cur_s * 1ll * s << "\n";
	}
}

• Subtask 1: 30 / 30
• Subtask 2: 10 / 10
• Subtask 3: 60 / 60