Every season at the copper works of Verdigris, someone must track down a clerical error. This year the task falls to Gino, armed only with the crates register. Task: Read n integers and print the largest absolute difference between two consecutive elements. For n=1 print 0. Input format: First line: n. Second line: n space-separated integers. Output format: Print the maximum consecutive absolute difference. Constraints: 1 <= n <= 56; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 56; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.
