HDU - 3506 Monkey Party

HDU - 3506 Monkey Party

---

问题描述：

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.

---

#include"stdio.h"
#include"string"
#include"algorithm"
using namespace std;
#define INF 99999999
int dp[2001][2001];
int s[2001][2001];
int mk[2001];
unsigned long long sum[2001] = { 0 };
int  solve(int n)
{
    for (int len = 1; len < n; ++len)
    {
        for (int i = 1; i + len <= 2*n; ++i)
        {
            int j = i + len; dp[i][j] = INF;
            for(int k=s[i][j-1];k<=s[i+1][j];k++)
            if (dp[i][k] + dp[k + 1][j] + sum[j] - sum[i - 1] < dp[i][j])
            {
                dp[i][j] = dp[i][k] + dp[k + 1][j] + sum[j] - sum[i - 1];
                s[i][j] = k;
            }
        }
    }
    int ans = INF;
    for (int i = 1; i <= n; ++i)
    {
        ans = min(ans, dp[i][i + n - 1]);
    }
    return ans;
}
int main()
{
    int n;
    while (scanf("%d", &n) != EOF)
    {
        for (int i = 1; i <= n; ++i)
        {
            scanf("%d", &mk[i]);
            mk[i + n] = mk[i];
        }
        for (int i = 1; i < 2 * n; ++i)
        {
            s[i][i] = i;
            dp[i][i] = 0;
            sum[i] = sum[i - 1] + mk[i];
        }
        printf("%d\n",solve(n));
    }
    return 0;
}