Given an array of integers find a subarray such that number of its elements multiplied by the smallest element in that subarray is as large as possible Input: First line: single integer N, the size of array Second line: N integer numbers, values of array elements. Output: The single number: answer for a problem Sample input: 5 1 2 3 2 1 Sample output: 6 Sample input: 9 1 1 1 2 3 2 1 1 1 Sample output: 9