购物

D - Shopping

Crawling in process...Crawling failedTime Limit:1000MSMemory Limit:65536KB 64bit IO Format:%lld & %llu

SubmitStatus

Description

Saya and Kudo go shopping together. You can assume the street as a straight line, while the shops are some points on the line. They park their car at the leftmost shop, visit all the shops from left to right, and go back to their car. Your task is to calculate the length of their route.

Input

The input consists of several test cases. The first line of input in each test case contains one integer N (0

Output

For each test case, print the length of their shopping route.

Sample Input

424 13 89 3767 30 41 14 39 420

Sample Output

15270

Hint

Explanation for the first sample: They park their car at shop 13; go to shop 24, 37 and 89 and finally return to shop 13. The total length is (24-13) + (37-24) + (89-37) + (89-13) = 152

代码：#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[10000000];
int main()
{
    int n,i,sum;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)
            break;
        memset(a,0,sizeof(a));
        for(i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a,a+n);
        sum=0;
        for(i=1; i<n; i++)
            sum+=(a[i]-a[i-1]);
        printf("%d\n",sum+a[n-1]-a[0]);
    }
    return 0;
}