Submission

Status:

[PP-SSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: Neozaawwman1

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-10 20:45:58

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<ll> num;
ll ans=0;
int main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin>>N;
    for(int i=0; i<N; i++){
        ll x;cin>>x;
        num.push_back(x);
    }
    for(int i=N-1; i>=0; i--){
        ll m=0;
        for(int j=i-1; j>=0; j--){
            m = max(m,num[i]-num[j]);
        }
        ans = max(ans,m);
    }
    cout<<ans;
    return 0;
}