#include<iostream>

using namespace std;

int length;
int height[20001]={0,};

int process(int x,int y)
{
    int mid=(x+y)/2;

    if(y-x==1 || y==x) 
    {
        if(height[x]>height[y]) return height[y]*(y-x+1);
        return height[x]*(y-x+1);
    }

    int left=process(x,mid);
    int right=process(mid+1,y);

    int i,j;
    int min=30000; int max=height[mid];

    for(i=mid,j=mid;i>=x,j<=y;)
    {
        if(height[i-1] > height[j+1]) i--;
        else j++;

        if(min>height[i]) min=height[i];
        if(min>height[j]) min=height[j];
        if(max<min*(j-i+1)) max=min*(j-i+1);


    }

    if(left>right) right=left;

    if(right>max) return right;
    else return max;
}

int main( )
{
    int T;
    for(cin >> T;T--;){

        cin >> length;

        for(int i=1;i<=length;i++) scanf("%d",&height[i]);

        cout << process(1,length) << endl;

    }
    return 0;   
}