Submission

Status:

[PP-SSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: Quaoar

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-11-29 22:43:35

#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll v[100000];
ll profit , best = -1;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    for (int i = 0 ; i < n; i++){
        cin >> v[i];
    }
    ll mn = v[0];
    ll mx_diff = 0;


    for (int i = 0 ; i < n ; i++){
        mx_diff = max(mx_diff , v[i] - mn);

        mn = min(mn , v[i]);
    }
    cout << mx_diff;
    
}