1388. Pizza With 3n Slices

There is a pizza with 3n slices of varying size, you and your friends will take slices of pizza as follows:

• You will pick any pizza slice.
• Your friend Alice will pick next slice in anti clockwise direction of your pick. 
• Your friend Bob will pick next slice in clockwise direction of your pick.
• Repeat until there are no more slices of pizzas.

Sizes of Pizza slices is represented by circular array slices in clockwise direction.

Return the maximum possible sum of slice sizes which you can have.

 

Example 1:

 

Input: slices = [1,2,3,4,5,6]
Output: 10
Explanation: Pick pizza slice of size 4, Alice and Bob will pick slices with size 3 and 5 respectively. Then Pick slices with size 6, finally Alice and Bob will pick slice of size 2 and 1 respectively. Total = 4 + 6.

Example 2:

Input: slices = [8,9,8,6,1,1]
Output: 16
Output: Pick pizza slice of size 8 in each turn. If you pick slice with size 9 your partners will pick slices of size 8.

Example 3:

Input: slices = [4,1,2,5,8,3,1,9,7]
Output: 21

Example 4:

Input: slices = [3,1,2]
Output: 3

 

Constraints:

• 1 <= slices.length <= 500
• slices.length % 3 == 0
• 1 <= slices[i] <= 1000

思路：第1块和最后一块不会同时拿，所以可以将环flatten成线。于是问题转化为：[0..n-1]或者[1,n]里面拿出和最大的n//3个数

class Solution(object):
    def maxSizeSlices(self, slices):
        """
        :type slices: List[int]
        :rtype: int
        """
        def helper(a, k):
            n = len(a)
            dp = [[0 for _ in range(k+1)] for _ in range(n)]
            dp[0][1] = a[0]
            for i in range(1, n):
                for j in range(1, k+1):
                    dp[i][j] = max(dp[i-1][j], dp[i-2][j-1]+a[i])
            return dp[n-1][k]

        return max(helper(slices[1:], len(slices)//3), helper(slices[:-1], len(slices)//3))