Monkey Party HDU - 3506

最新推荐文章于 2021-11-29 13:29:15 发布

accept_2333

最新推荐文章于 2021-11-29 13:29:15 发布

阅读量87

点赞数

分类专栏： dp

本文链接：https://blog.csdn.net/accept_2333/article/details/113257128

版权

dp 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Far away from our world, there is a banana forest. And many lovely monkeys live there. One day, SDH(Song Da Hou), who is the king of banana forest, decides to hold a big party to celebrate Crazy Bananas Day. But the little monkeys don’t know each other, so as the king, SDH must do something.
Now there are n monkeys sitting in a circle, and each monkey has a making friends time. Also, each monkey has two neighbor. SDH wants to introduce them to each other, and the rules are:
1.every time, he can only introduce one monkey and one of this monkey’s neighbor.
2.if he introduce A and B, then every monkey A already knows will know every monkey B already knows, and the total time for this introducing is the sum of the making friends time of all the monkeys A and B already knows;
3.each little monkey knows himself;
In order to begin the party and eat bananas as soon as possible, SDH want to know the mininal time he needs on introducing.
Input
There is several test cases. In each case, the first line is n(1 ≤ n ≤ 1000), which is the number of monkeys. The next line contains n positive integers(less than 1000), means the making friends time(in order, the first one and the last one are neighbors). The input is end of file.
Output
For each case, you should print a line giving the mininal time SDH needs on introducing.
Sample Input
8
5 2 4 7 6 1 3 9
Sample Output
105
类似于石头合并，要用到平行四边形优化
下面给出两个定理

定理一：如果上述的w函数同时满足区间包含单调性和四边形不等式性质，那么函数m也满足四边形不等式性质。

我们再定义s(i,j)表示m(i,j)取得最优值时对应的下标（即i≤k≤j时，k处的w值最大，则s(i,j)=k）。此时有如下定理

定理二：假如m(i,j)满足四边形不等式，那么s(i,j)单调，即s(i,j)≤s(i,j+1)≤s(i+1,j+1)。
记住就行，无需懂原理（因为我看不懂怎么证明的，说到底我菜）。

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include
#include
#include<math.h>
#include
#include<string.h>
#include
#define ll long long
const int inf = 0x3f3f3f;
using namespace std;
int w[30];
int n, m, dp[2005][2005],s[2005][2005];
int x;
int a[20005];
int main()
{
while (cin >> n)
{
memset(a, 0, sizeof(a));
memset(dp, inf, sizeof(dp));
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
a[i + n] = a[i];
}
for (int i = 1; i <= 2 * n; i++)
{
a[i] = a[i] + a[i - 1];
dp[i][i] = 0;
s[i][i] = i;
}
for (int len = 2; len <= n; len++)
{
for (int l = 1; l <= 2 * n - len + 1; l++)
{
int r = l + len - 1;
for (int k = s[l][r - 1]; k <= s[l + 1][r]; k++)
{
if (dp[l][k] + dp[k + 1][r] + a[r] - a[l - 1] < dp[l][r]) {
dp[l][r] = dp[l][k] + dp[k + 1][r] + a[r] - a[l - 1];
s[l][r] = k;
}
}
}
}
int ans = 1e9+7;
for (int i = 1; i <= n; i++)
{
ans = min(ans, dp[i][i + n - 1]);
}
cout << ans << endl;
}
return 0;
}