Submission

Score: 0

User: singtoppy

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-08 17:55:00

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

#define ll long long
#define pii pair<int, int>

int n, A[100005], dp[100005];

void solve () {
	cin >> n;
	for(int i = 0; i < n; i++)
		cin >> A[i];
	int res = 0;
	for(int i = 0; i < n; i++) {
		dp[i + 1] = max(dp[i + 1], dp[i] + A[i + 1] - A[i]); 
		res = max(res, dp[i + 1]);
	}
	cout << res;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);	

	solve();

	return 0;
}