Submission

Score: 0

User: Quaoar

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-11-29 22:10:32

#include <iostream>
using namespace std;
typedef long long ll;
ll num[100000];
ll profit , best;

int main(){
    int n;
    cin >> n;
    for (int i = 0 ; i < n; i++){
        cin >> num[i];
    }

    for (int i = 0 ; i < n ; i++){
        for (int j = i + 1 ; j < n ;j++){
            profit = num[j] - num[i];
            best = max(best , profit);
        }
    }
    cout << best;
    
}