TOJ 3498.Differences

题目链接：http://acm.tju.edu.cn/toj/showp3498.html

3498.    Differences

---

Time Limit: 1.0 Seconds    Memory Limit: 65536K
Total Runs: 860    Accepted Runs: 310

---

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 [-2⁶⁴+1,2⁶⁴-1].

Output

For each case, print the answer.

Sample Input

1
5
1 2 3 4 5

Sample Output

4

Source: TJRAC Team Selection 2010 (2)

---

Submit   List    Runs   Forum   Statistics

水题，上代码：

#include <stdio.h>
#define MAX (long long)1<<62
int main(){
	int ca,n;
	long long number,maxnum,minnum;
	scanf("%d",&ca);
	while(ca--){
		scanf("%d",&n);
		maxnum=-1*MAX;
		minnum=MAX;
		for(int i=0;i<n;i++){
			scanf("%lld",&number);
			if(maxnum<number)
				maxnum=number;
			if(minnum>number)
				minnum=number;
		}
		printf("%lld\n",maxnum-minnum);
	}
}