山东省第一届省赛重现 G:Shopping

 1 #include <iostream>
 2 #include <stdio.h>
 3 using namespace std;
 4 
 5 int main()
 6 {
 7     int n;
 8     int a[100010];
 9     while(scanf("%d",&n)!=EOF){
10         if(n==0) break;
11         long long Max=0,Min=9999999999;
12         for(int i=1;i<=n;i++){
13             scanf("%d",&a[i]);
14             if(a[i]>Max)    //找到最大值
15                 Max = a[i];
16             if(a[i]<Min)    //找到最小值
17                 Min = a[i];
18         }
19         long long sum =(Max-Min)*2;
20         cout<<sum<<endl;
21     }
22 
23     return 0;
24 }