
    Given a list of user interaction scores from a social network, find the highest possible compatibility rating that can be achieved by selecting a group of users whose interaction scores form an increasing sequence and multiplying those scores together. This compatibility rating will be used to identify the most promising group of users for friend recommendations.
    

    
def max_product(arr):
    """
    Given a list of user interaction scores from a social network, find the highest possible compatibility rating that can be achieved by selecting a group of users whose interaction scores form an increasing sequence and multiplying those scores together. This compatibility rating will be used to identify the most promising group of users for friend recommendations.
    

    """
def max_product(arr):
    """
    Given a list of user interaction scores from a social network, find the highest possible compatibility rating that can be achieved by selecting a group of users whose interaction scores form an increasing sequence and multiplying those scores together. This compatibility rating will be used to identify the most promising group of users for friend recommendations.
    

    """
    n = len(arr)
    mpis = arr[:]
    for i in range(n):
        current_prod = arr[i]
        j = i + 1
        while j < n:
            if arr[j - 1] > arr[j]:
                break
            current_prod *= arr[j]
            if current_prod > mpis[j]:
                mpis[j] = current_prod
            j = j + 1
    return max(mpis)