Submission

Score: 0

User: Test

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-11-30 18:24:34

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

int main(){
    int n;
    cin >> n;
    vector<int> A(n);
    for(int i=0;i<n;i++){
        cin >> A[i];
    }
    int max_pro=0;
    for(int i=0;i<n-1;i++){
        for(int j=0;j<n-1;j++){
            if(A[i+1]>A[i]){
                if(A[i+j]-A[i]>=max_pro){
                    max_pro=A[i+j]-A[i];
                }
            }
        }
    }
    cout << max_pro;
}