Submission

Status:

[PPPPPPPPPPPPP]

Subtask/Task Score:

{100/100}

Score: 100

User: okazagiFragment

Problemset: ซื้อขายหุ้นซีเค

Language: cpp

Time: 0.009 second

Submitted On: 2026-03-20 21:50:45

#include <bits/stdc++.h>
using namespace std;
#define okazaki cin.tie(nullptr)->sync_with_stdio(0),cout.tie(0);
#define int long long
#define pii pair<int,int>
#define tii tuple<int,int,int>
int n,m,q;
signed main(void) {
	okazaki;
	cin>>n;
	int grid[n];
	for(int i=0;i<n;i++){
		cin>>grid[i];
	}
	int i=0,low=grid[0],high=grid[0],ans=0;
	while(i<n-1){
		while(i<n-1&&grid[i]>=grid[i+1]){
			i++;
		}low=grid[i];
		while(i<n-1&&grid[i]<=grid[i+1]){
			i++;
		}high=grid[i];
		ans+=(high-low);
	}
	cout<<ans;
}