题目链接:https://www.nowcoder.com/practice/00fccaa8e30d414ab86b9bb229bd8e68
解题参考链接:
1. https://blog.csdn.net/carson0408/article/details/78013895
2.【by 30号小学生】https://www.nowcoder.com/questionTerminal/00fccaa8e30d414ab86b9bb229bd8e68?f=discussion
思路:
求最大回文串,即求一个数组正序与倒序的最大公共串,并用一个二维数组dp进行记录和。注意判定条件,当s1[i]==s2[j]时,dp[i][j]=dp[i-1][j-1]+s1[i];否则dp[i][j]=max(dp[i-1][j],dp[i][j-1]),这两个判定将所有回文串的可能性都考虑进去了,那么最大回文串的和就是dp[-1][-1],那么结果就是2*sum(s1)-dp[-1][-1]
n = int(input())
nums = list(map(int,input().split()))
dp = [[0]*(n+1) for i in range(n+1)]
for i in range(1,n+1):
for j in range(1,n+1):
if nums[i-1] == nums[n-j]:
dp[i][j] = dp[i-1][j-1] + nums[i-1]
else:
dp[i][j] = max(dp[i][j-1],dp[i-1][j])
print(sum(nums)*2-dp[n][n])