Submission

Score: 0

User: Seng

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-07 10:36:51

#include <bits/stdc++.h>
using namespace std;
int p[100005];

int main(){

    int n;cin >> n;
    int mx = 0;

    for(int i = 1; i <= n; i++){
        cin >> p[i];
    }

    for(int i = 1; i < n; i++){
        for(int j = i; j <= n; j++){
            mx = max(mx, p[j]-p[i]);
        }
    }

    cout << mx;

    return 0;
}