Submission
Status:
[PPPP-SSSSSSSS]
Subtask/Task Score:
{0/100}
Score: 0
User: raidina
Problemset: ซื้อขายหุ้นซีเค
Language: cpp
Time: 0.024 second
Submitted On: 2026-03-06 19:42:59
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100002;
int n,a[N],dp[N],sum;
bool ok[N];
int main(){
cin >> n;
for(int i = 1;i<=n;i++){
cin >> a[i];
}
for(int i = 1;i<=n;i++){
if(a[i+1]>a[i] && ok[i]==true){
ok[i+1]=true;
}
else if(a[i+1]>a[i] && ok[i]==false){
sum-=a[i];
ok[i+1]=true;
}
else if((i==n || a[i+1]<a[i]) && ok[i]==true){
ok[i+1]=false;
sum+=a[i];
}
}
cout << sum;
}