Submission

Status:

[PPPPPPPPPP]

Score: 100

User: njoop

Problemset: stock

Language: cpp

Time: 0.009 second

Submitted On: 2025-03-25 08:53:28

#include <bits/stdc++.h>
#define ll long long

using namespace std;

int n, arr[1000010], ans, dp[1000010];


int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    dp[0] = 1e9;
    for(int i=1; i<=n; i++) {
        cin >> arr[i];
        dp[i] = min(dp[i-1], arr[i]);
        ans = max(ans, arr[i]-dp[i]);
    }
    cout << ans;
}