Submission

Status:

[PPPPTSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: faofao

Problemset: stock

Language: cpp

Time: 1.097 second

Submitted On: 2025-10-13 11:34:19

#include <iostream>
#include <string>
using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr) ;
    
    int n ; cin >> n;
    long long arr[n] ;
    long long max=0 ;

    for(int i=0 ; i<n ; i++){
        cin >> arr[i] ;
    }
    if(n==1){
        max=arr[0] ;
        cout << max ;
        return 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 ;
    return 0;
}