python 牛客真题 合唱团

n=int(input())
performance=list(input().split())
kd=list(input().split())
k=int(kd[0])
d=int(kd[1])
dp=[[0]*n for _ in range(k)]
dp1=[[0]*n for _ in range(k)]
for j in range(n):
    performance[j]=int(performance[j])
    dp[0][j]=performance[j]
    dp1[0][j]=performance[j]
for i in range(1,k):
    for j in range(n):
        for k in range(max(j-d,0),j):
            dp[i][j]=max(dp[i][j],dp1[i-1][k]*performance[j],dp[i-1][k]*performance[j])
            dp1[i][j]=min(dp1[i][j],dp1[i-1][k]*performance[j],dp[i-1][k]*performance[j])
print(max(dp[-1]))