题目

本题链接：Monkey Party

本博客给出本题截图：

AC代码

代码：

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 2010, INF = 0x3f3f3f3f;

int f[N][N];
int t[N];
int s[N];
int w[N][N];

int main()
{
    int n;
    while(~scanf("%d", &n))
    {
        for (int i = 1; i <= n; i ++ )
        {
            cin >> t[i];
            t[i + n] = t[i];
        }
    
        memset(f, 0x3f, sizeof f);
        for (int i = 1; i <= 2 * n; i ++ ) 
        {
            f[i][i] = 0;
            w[i][i] = i;
            s[i] = s[i - 1] + t[i];
        }
    
        for (int len = 2; len <= n; len ++ )
            for (int i = 1; i + len - 1 <= 2 * n; i ++ )
            {
                int j = i + len - 1;
                for (int k = w[i][j - 1]; k <= w[i + 1][j]; k ++ )
                {
                    if (f[i][j] > f[i][k] + f[k + 1][j] + s[j] - s[i - 1])
                    {
                        f[i][j] = f[i][k] + f[k + 1][j] + s[j] - s[i - 1];
                        w[i][j] = k;
                    }
                }
            }
        
        int res = INF;
        for (int i = 1; i <= n; i ++ )
            res = min(res, f[i][i + n - 1]);
        
        cout << res << endl;
    }
    
    return 0;
}

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
  
43
  
44
  
45
  
46
  
47
  
48
  
49
  
50
  
51
  
52
  
53
  
54
  
55
 

文章来源: chen-ac.blog.csdn.net，作者：辰chen，版权归原作者所有，如需转载，请联系作者。

原文链接：chen-ac.blog.csdn.net/article/details/121607701