C1 - Maximum Joy (Easy Version)

locked

This is the easy version of the problem. The difference between the two versions is that the constraints are different

With the Valentine's Day coming around the corner , it has created a buzz this week but it doesn't bother Bruno as he his constantly been programming and he his in his own world. This time around he need's your help in solving a simple problem.

Given an array of positive elements . You start at time and choose any position of the array and start visiting the array elements in left to right order (linear) till the last element where visiting each array element takes 1 second. When you reach the last element you have to revert back to position of the array and continue the process till you have visited all elements in array and the total time taken will be seconds. You have to choose a position in the array to start such that you need to obtain the sum of costs of visiting all array elements to be maximum. where cost of each element is given by :-

,

here denotes the time at which you reach the element and is the position of the element

For example if we take an array if we start from position 3 of the array then total sum of costs will be Initially you visit the 3rd element of the array in the second and then you go back to 1st element in seconds and then to the next element in seconds and then you terminate as you have visited all elements in total secs.

Find the maximum sum you can obtain.

Input Format

  • The first line consists of , the number of test cases
  • The first line of each test case consists of an integer
  • The second line of each test case consists of an array of space separated positive integers.

Constraints

Output Format

  • For each test case ouput an integer denoting the maximum sum of costs obtained

Sample Input 0

2
3
4 6 2
5
3 1 5 2 4

Sample Output 0

28
48

Explanation 0

  • For second test case the total cost we get when we start from position is and is the maximum possible sum you can get
Line: 1 Col: 1
  1. Challenge Walkthrough
    Let's walk through this sample challenge and explore the features of the code editor.1 of 6
  2. Review the problem statement
    Each challenge has a problem statement that includes sample inputs and outputs. Some challenges include additional information to help you out.2 of 6
  3. Choose a language
    Select the language you wish to use to solve this challenge.3 of 6
  4. Enter your code
    Code your solution in our custom editor or code in your own environment and upload your solution as a file.4 of 6
  5. Test your code
    You can compile your code and test it for errors and accuracy before submitting.5 of 6
  6. Submit to see results
    When you're ready, submit your solution! Remember, you can go back and refine your code anytime.6 of 6
  1. Check your score