BETA

Difficulty Level:

Easy

Total Submissions: 1170 Accuracy:

38.38%

Find Maximum value (Function Problem)
     

Given an array A[ ] your task is to complete the function max_val which finds the maximum value of abs(i – j) * min(arr[i], arr[j]) where i and j vary from 0 to n-1. 

Input:
The first line of input contains an integer T denoting the no of test cases then T test cases follow. Each test case contains 2 lines. The First line of each test case contains an integer N denoting the size of the array. In the next line are N space separated values of the array A[ ] .

Output:
For each test case in a new line output will be the max values obtained.

Constraints:
1<=T<=100
1<=N<=100
-100<=A[]<=1000

Example(To be used only for expected output):
Input

2
4
3 2 1 4
4
8 1 9 4
Output

16

Explanation:
(i) For the first test case a[0] = 3 and a[3] = 4 and thus result is  abs(0-3)*min(3,4) = 9.
(ii) For the second test ase a[0]=8 and a[2]=9 thus result is abs(0-2)*min(8,9) = 16. 


Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Amit Khandelwal


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.