#
# @lc app=leetcode id=1464 lang=python3
#
# [1464] Maximum Product of Two Elements in an Array
#
# https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/description/
#
# algorithms
# Easy (83.36%)
# Likes:    49
# Dislikes: 6
# Total Accepted:    12.5K
# Total Submissions: 15K
# Testcase Example:  '[3,4,5,2]'
#
# Given the array of integers nums, you will choose two different indices i and
# j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1).
# 
# Example 1:
# 
# 
# Input: nums = [3,4,5,2]
# Output: 12 
# Explanation: If you choose the indices i=1 and j=2 (indexed from 0), you will
# get the maximum value, that is, (nums[1]-1)*(nums[2]-1) = (4-1)*(5-1) = 3*4 =
# 12. 
# 
# 
# Example 2:
# 
# 
# Input: nums = [1,5,4,5]
# Output: 16
# Explanation: Choosing the indices i=1 and j=3 (indexed from 0), you will get
# the maximum value of (5-1)*(5-1) = 16.
# 
# 
# Example 3:
# 
# 
# Input: nums = [3,7]
# Output: 12
# 
# 
# 
# Constraints:
# 
# 
# 2 <= nums.length <= 500
# 1 <= nums[i] <= 10^3
# 
#

# @lc code=start
class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        n1, n2 = [-1,-1], [-2, -2]
        for i, n in enumerate(nums):
            if n > n1[0]:
                n2 = n1
                n1 = [n, i]
            elif n > n2[0]:
                n2 = [n, i]
        return (n1[0]-1)*(n2[0]-1)




        
# @lc code=end

