제출 #753758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
753758		vjudge1	Foehn Phenomena (JOI17_foehn_phenomena)	C++14	100 / 100	539 ms	13016 KiB

foehn_phenomena

#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, q, s, t, l, r, x, ans;
ll a[200010], diff[200010];

int main(){
	cin >> n >> q >> s >> t;
	for(int i=0; i<=n; i++){
		cin >>a[i];
		diff[i]=a[i]-a[i-1];
		if(diff[i]>0) ans-=diff[i]*s;
		else ans -=diff[i]*t;
	}
//	cout << ans << endl;
	while(q--){
		cin >> l >> r >> x;
		ll lprev, rprev, lnow, rnow;
		if(diff[l]>0) lprev=-(diff[l]*s); else lprev=-(diff[l]*t);
		if(diff[r+1]>0) rprev=-(diff[r+1]*s); else rprev=-(diff[r+1]*t);
		if(r+1>n) rprev=0; 
//		for(int i=0; i<=n; i++) cout << diff[i] << " "; cout << endl;
//		cout << lprev <<" " << rprev << endl;
		
		diff[l]+=x; diff[r+1]-=x;
		
		if(diff[l]>0) lnow=-(diff[l]*s); else lnow=-(diff[l]*t);
		if(diff[r+1]>0) rnow=-(diff[r+1]*s); else rnow=-(diff[r+1]*t);
		if(r+1>n) rnow=0; 
//		for(int i=0; i<=n; i++) cout << diff[i] << " "; cout << endl;
//		cout << lnow <<" " << rnow << endl;
		ans+=(lnow-lprev)+(rnow-rprev);
		cout << ans << endl;		
	}
	return 0;
}

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