Submission

Score: 0

User: Seng

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-07 10:42:27

#include <bits/stdc++.h>
using namespace std;
int p[100005];
int dp[100005];

int main(){

    ios::sync_with_stdio(0);cin.tie(0);

    int n;cin >> n;
    int mx = 0;

    for(int i = 1; i <= n; i++){
        cin >> p[i];
        dp[i] = p[i];
    }

    for(int i = 2; i <= n; i++){
        mx = max(mx, p[i]-p[i-1]);
        mx = max(mx, p[i]-p[i-2]);
    }

    cout << mx;

    return 0;
}