#include <iostream>
#include <string>

using namespace std;

static int N = 0;
static int* blockHeights = nullptr;

int Fence(int left, int right){
    int volume = 0;
    int ret = 0;
    int min_height = 10001;
    int pivot = 0;

    if(left>=right){
        return blockHeights[left];
    }
    for(int i=left; i<right; i++){
        if(blockHeights[i]<min_height){
            min_height = blockHeights[i];
            pivot = i;
        }
    }
    volume = (right-left) * min_height;

    ret = Fence(left, pivot);
    if(volume < ret)
        volume = ret;
    ret = Fence(pivot+1, right);
    if(volume < ret)
        volume = ret;
    return volume;
}
int main(void){
    int C = 0;
    int caseCnt = 0;
    int* resultArr = nullptr;

    cin>>C;
    resultArr = new int[C];

    while(caseCnt < C){
        int val = 0;
        cin>>N;
        blockHeights = new int[N];
        for(int i=0; i<N; i++)
            cin>>blockHeights[i];

        val = Fence(0, N);
        resultArr[caseCnt] = val;
        delete[] blockHeights;
        caseCnt++;
    }

    for(int i=0; i<caseCnt; i++)
        cout<<resultArr[i]<<endl;
    return 0;
}