제출 #384225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
384225		aryan12	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	158 ms	13164 KiB

foehn_phenomena

#include <bits/stdc++.h>
using namespace std;
#define int long long

void Solve() {
	int n, q, dec, inc;
	cin >> n >> q >> dec >> inc;
	int a[n + 1], diff[n + 1];
	for(int i = 0; i <= n; i++) {
		cin >> a[i];
		diff[i] = 0;
	}
	int curAns = 0;
	for(int i = 1; i <= n; i++) {
		diff[i] = a[i] - a[i - 1];
		if(a[i] <= a[i - 1]) {
			curAns += inc * (a[i - 1] - a[i]);
		}
		else {
			curAns -= dec * (a[i] - a[i - 1]);
		}
	}
	for(int i = 1; i <= q; i++) {
		int l, r, x;
		cin >> l >> r >> x;
		curAns -= (diff[l] <= 0) ? (inc * (-diff[l])) : -(dec * diff[l]);
		diff[l] += x;
		curAns += (diff[l] <= 0) ? (inc * (-diff[l])) : -(dec * diff[l]);
		if(r != n) {
			curAns -= (diff[r + 1] <= 0) ? (inc * (-diff[r + 1])) : -(dec * diff[r + 1]);
			diff[r + 1] -= x;
			curAns += (diff[r + 1] <= 0) ? (inc * (-diff[r + 1])) : -(dec * diff[r + 1]);
		}
		cout << curAns << "\n";
	}
}

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	Solve();
	return 0;
}

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