1-5-05: The element maximum span value for an integer sequence

Describe

Given a sequence of non-negative integers of length n, calculate the maximum span value of a series (maximum span value = maximum value minus minimum value).

Enter a total of 2 rows, the number of the first action sequence N (1 <= n <= 1000), the second behavior sequence of n not more than 1000 non-negative integers, the integers are separated by a space. An output line that represents the maximum span value of the sequence. Sample input

63 0 8 7 5 9

Sample output

9

Source adapted from Yuanpei-from WHF

#include <stdio.h>intMain () {intn,i,x,max=-1, min=99999, L; scanf ("%d",&N);  for(i=1; i<=n;i++) {scanf ("%d",&x); if(max<x) Max=x; //find the maximum value        if(min>x) Min=x; //Find minimum Value} L=max-min; printf ("%d", L); return 0;}

1-5-05: The element maximum span value for an integer sequence