CXB attended an interview and the interviewer given him a problem. The problem asked him to be in a sequence to find the difference between the maximum and minimum values.
Input
The first line of the input contains ca (ca ≤ 1000).
The following ca test case. For each test case, there are two lines. There is a integer number of n in the first line (1 ≤ n ≤ 1000). There are n number of integer numbers in next line. The range of each number is [-264+1,264-1].
Output
For each case, print the answer.
Sample Input
1
5
1 2 3 4 5
Sample Output
4
题意概述:纯属水题,不多说了。
解题思路:在输入的同时更新最大值和最小值,输出最大值与最小值之差,唯一需要注意的是要使用long long int。
源代码:
#include<iostream>
using namespace std;
int main()
{
int T,N;
long long int min,max,num;
cin>>T;
while(T--)
{
cin>>N;
cin>>num;
min=max=num;
for(int i=1;i<N;++i)
{
cin>>num;
if(min>num)min=num;
if(max<num)max=num;
}
cout<<max-min<<endl;
}
return 0;
}