首页 > itarticle > uva 11364 – parking

uva 11364 – parking

admin 11月 12, 2020 0

Contents

Problem

題目網址
 中文網址

Solution

只要停在最左和最右的店家之間，都要來回走一趟回到車子，距離都是 (max - min) * 2 。

Code

UVa 11364 UVa 11364 - Parking



int ()
{
    int Case;
    scanf("%d", &Case);
    while (Case--)
    {
        int n, i, min = 100, max = 0, num;
        scanf("%d", &n);

        for (i = 0; i < n; i++)
        {
            scanf("%d", &num);
            if (num > max)
                max = num;
            if (num < min)
                min = num;
        }

        printf("%dn", (max - min) * 2);
    }
    return 0;
}