Submission

Status:

[PP-SSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: faofao

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-21 22:32:04

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

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    ll n ; cin >> n;
    ll arr[n] ;
    for(int i=0 ; i<n ; i++){
        cin >> arr[i] ;
    }

    ll max = 0 ;

    for(ll i=0 ; i<n ; i++){
        for(ll j=i+1 ; j<n ; j++){
            if(arr[j]-arr[i]>max) max = arr[j]-arr[i] ;
        }
    }

    cout << max ;
}