Find the largest rectangular area possible in a given histogram where the largest rectangle can be made of a number of contiguous bars. For simplicity, assume that all bars have same width and the width is** 1 unit**.

**Input:**

The first line contains an integer 'T' denoting the total number of test cases. T test-cases follow. In each test cases, the first line contains an integer 'N' denoting the size of array. The second line contains N space-separated integers A_{1}, A_{2}, ..., A_{N} denoting the elements of the array. The elements of the array represents the height of the bars.

**Output:**

For each test-case, in a separate** **line, the maximum rectangular area possible from the contiguous bars.

**Constraints:**

1 <= T <= 100

1 <= N <= 10^{3}

1 <= A[i] <= 10^{18}

**Example:**

**Input: **

1

7

6 2 5 4 5 1 6

**Output:**

12

**Explanation:
Testcase1:**

lakshmi_pandey | 72 |

abbatta7 | 68 |

Ashish Kumar Vaishy | 62 |

aman19 | 58 |

Kumar Gaurav Singh | 58 |

saumitra13325 | 612 |

ashujack | 551 |

lakshmi_pandey | 544 |

aman19 | 538 |

piyushmittal25 | 514 |

blackshadows | 5249 |

akhayrutdinov | 5111 |

Ibrahim Nash | 5087 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.