제출 #701419

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
701419		happypotato	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	490 ms	13172 KiB

foehn_phenomena

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
	ll n, q, s, t;
	cin >> n >> q >> s >> t;
	ll a[n + 1];
	for (int i = 0; i <= n; i++) cin >> a[i];
	ll ans = 0;
	ll diff[n + 1];
	for (int i = 1; i <= n; i++) {
		diff[i] = a[i] - a[i - 1];
		if (diff[i] > 0) ans -= s * diff[i];
		else ans += t * -diff[i];
	}
	while (q--) {
		int l, r, k;
		cin >> l >> r >> k;
		if (l >= 1) {
			if (diff[l] > 0) ans += s * diff[l];
			else ans -= t * -diff[l];

			diff[l] += k;
			
			if (diff[l] > 0) ans -= s * diff[l];
			else ans += t * -diff[l];
		}
		if (r < n) {
			if (diff[r + 1] > 0) ans += s * diff[r + 1];
			else ans -= t * -diff[r + 1];

			diff[r + 1] -= k;
			
			if (diff[r + 1] > 0) ans -= s * diff[r + 1];
			else ans += t * -diff[r + 1];
		}
		cout << ans << endl;
	}
}

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