Submission

Score: 0

User: tHeNyXs

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-05 15:15:23

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n; cin >> n;
    ll p[n];
    for (int i = 0; i < n; ++i) cin >> p[i];

    vector<ll> dp(n, 0);
    for (int i = n-1; i >= 0; --i) {
        for (int j = i-1; j >= 0; --j) {
            dp[i] = max(dp[i], p[i] - p[j]);
        }
    }
    cout << *max_element(dp.begin(), dp.end());

    return 0;
}