DEMO-C-32 • Programming in C
You are given an array of integers. Your task is to find the maximum value of: arr[j] - arr[i] where j > i (the larger element must come after the smaller element in the array) In other words: choose two positions in the array where the second number comes later, and compute the difference. Output the largest difference you can get.
Input:
5
7 1 5 3 6
Output:
5
(6 - 1 = 5)
First line: an integer n (number of elements)
Second line: n integers (the array)
Print one integer: the maximum difference arr[j]−arr[i] or any j>i
Submit runs every public testcase in this browser. Results and code never leave this device.
5 2 3 10 6 4
8
5 10 8 6 4 2
-2
5 7 9 5 6 3
2
6 1 5 3 9 2 8
8
1 42
0
C, C++, Java, and Python run locally in a browser VM. No worker or visualizer is used.
/workspace/question