L-The math problem
Description:
Given an array a with n intergers, please tell me the max(aj−ai),0≤i≤j≤n−1.
Input:
The input consists of multiple test cases. The first line contains an integer T, indicating the number of test cases.(1≤T≤1000)
Each case contains one integer N.(0≤N≤10^7). Then comes a line with N intergers ai(−10^7≤ai≤10^7)Output:
For each case only output the answer.
Sample Input:
1
5
1 3 5 4 2
Sample Output:
4
题目意思:
就是给你n个数,然后让你找max{aj-ai},其中j>=i的。
思路:
首先我们要知道我们最好只能扫一遍就能求出。所以要不断更新最小值和最大差值。
可以这样想,我们从第一个数开始扫,得到当前值 a[i] ,当遇到比我们当前最小值 minN