BCCAR SPOJ

BCCAR.cpp

#include <bits/stdc++.h>

#define _for(i,a,b) for(int i=(a),_b_=(b),_d_=(a<b?1:-1);i!=_b_;i+=_d_)
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define FORD(i,a,b) for(int i = a, i >= b; i--)
#define _it(i,v) for (typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define _all(v) v.begin(), v.end()

#define DEBUG(x) { cout << #x << " = " << x << endl; }
#define sqr(x) ((x)*(x))
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// end KMP algorithm

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    #ifndef ONLINE_JUDGE
    freopen("INPUT.inp", "r", stdin);
    #endif

    // solution starts...
    int n, test;
    cin >> test;
    int A[25];
    while(test--){
        cin >> n;
        FOR(i,1,n) cin >> A[i];
        sort(A + 1, A + 1 + n);
        int ans = 0;
        FOR(i,2,n) {
            ans += A[i] - A[i-1];
        }
        ans += A[n] - A[1];
        cout << ans << '\n';
    }

    // solution ends...

    return 0;
}