Submission

Status:

[PP-SSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: faofao

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-21 22:28:48

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

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

    int max = 0 ;

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

    cout << max ;
}