public class Main {
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int caseNum = in.nextInt();
        for(int cNum = 0; cNum < caseNum; cNum++){
            int num = in.nextInt();
            int[] fence = new int[num];
            for(int i = 0; i < num; i++){
                fence[i] = in.nextInt();
            }
            System.out.println(cut(fence, 0, fence.length-1));
        }
    }

    static int cut(int[] fence, int left, int right){
        int mid = (left+right)/2;
        if(left == right){
            return fence[left];
        } else {
            int leftCut = cut(fence, left, mid);
            int rightCut = cut(fence, mid+1, right);
            int maxValue = max(leftCut, rightCut);
            maxValue = max(maxValue, maxCut(fence, mid));
            return maxValue;
        }
    }

    static int maxCut(int[] fence,int i){
        int left = i-1;
        int right = i+1;
        int count = 1;
        int max = Integer.MIN_VALUE;
        while(left >= 0 && fence[i] <= fence[left]){
            count++;
            left -= 1;
        }
        while(right < fence.length && fence[i] <= fence[right]){
            count++;
            right += 1;
        }
        if(max < (fence[i]*count))
            max = fence[i]*count;
        return max;
    }

    static int max(int a, int b){
        if(a > b)
            return a;
        else
            return b;
    }
}