传送门 E Eat Walnuts As we all know, in the ACM ICPC held in 2017, the organizer of Xinjiang University presented a box of walnuts to each coach. Our coach is happy to share with the team members except Mr.Watermelon. He is going to test Mr.Watermelon wi
https://ac.nowcoder.com/acm/contest/8688/E 给定一串数字a b c d e，删除某个数的代价是左右和的平方，eg: 删b，代价是(a+b+c)2 ，求最小代价 解： dp[i][j]代表从i~j的最小代价，不会删除i和j（因为靠边凑不了3个） dp[i][j]=min(dp[i][j],dp[i][h]+dp[h][j]+(a[i]+a[h]+a[j])2) 注意d
题目连接：https://ac.nowcoder.com/acm/contest/8688/E CSDN食用链接：https://blog.csdn.net/qq_43906000/article/details/109407374 As we all know, in the ACM ICPC held in 2017, the organizer of Xinjiang University presented a box of walnuts to each coach. Our coach i
