Noi / 1.5 06: element maximum span value of integer sequence

describe

Given a length of n A sequence of nonnegative integers , Please calculate the maximum span of the sequence （ Maximum span value = The maximum minus the minimum ）.

Input

altogether 2 That's ok , The number of the first behavior sequence n（1 <= n <= 1000), The second behavior sequence n No more than one. 1000 Non-negative integer , Integers are separated by a space .

Output

Output one line , Represents the maximum span value of the sequence .

The sample input

6
3 0 8 7 5 9

Sample output

9

Problem analysis ： Find the maximum value by cycling , Set an intermediate value to constantly exchange the order of elements in the array , You can finally find the maximum value and lock the minimum value as the first element , That is to say a[0].

Source code ：

#include <iostream>
using namespace std;
int main()
{
	int n,i,j,t;
	int a[1005];
	cin>>n;
	for(i=0;i<n;i++)
		cin>>a[i];
	for(j=0;j<n-1;j++)
	{
		for(i=0;i<n-j-1;i++)
		{
			if(a[i+1]<a[i])
			{
				t=a[i+1];
				a[i+1]=a[i];
				a[i]=t;                    
			}
		}
	}
	cout<<a[n-1]-a[0];
	return 0;
}