Stock Buy Sell

Problem Statement

Input Format

First line contains N. Second line contains N space-separated stock prices.

Output Format

Print the maximum profit.

Constraints

1 <= N <= 1000

Sample Input

6
7 1 5 3 6 4

Sample Output

5

Explanation

Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6 - 1 = 5.

Starter Code

#include <stdio.h>

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        int arr[n];
        for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
        // Write your code here
    }
    return 0;
}

Limits

• Time Limit: 1s
• Memory Limit: 256MB