poj3632 Optimal Parking!

 

#include <cstdio>
using namespace std;
int main(){
   int nCase;
   scanf("%d",&nCase);
   
   while(nCase--){
      int n;
      scanf("%d",&n);
      int max=0,min=0 ,input;
      while(n--){
        scanf("%d",&input);
		 if(input>max){
		     max=input;
		 }
	 	 if(min==0){
     	     min=input;	
     	 }else if(input<min){
 	     	min=input;
 	     }
      }
	  printf("%d\n",2*(max-min));
   }
    return 0;
}