Submission

Score: 0

User: exoworldgd

Problemset: stock

Language: cpp

Time: 0.000 second

Submitted On: 2025-05-27 09:31:17

#include <bits/stdc++.h>
using namespace std;
int main(void) {
	int n;
    cin >> n;
    int dp[n+1],a[n+1];
    memset(dp,0,sizeof(dp));
    dp[0] = INT_MAX;
    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;
}