题目

本题链接：You Are the One

本博客给出本题截图：

AC代码

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

using namespace std;

const int N = 110;

int f[N][N];
int d[N];
int s[N];

int main()
{
    int T;
    cin >> T;
    
    int t = 1;
    while (T -- )
    {
        int n;
        cin >> n;
        for (int i = 1; i <= n; i ++ ) cin >> d[i];
        
        memset(f, 0, sizeof f);
        //memset(f, 0x3f, sizeof f);
        memset(s, 0, sizeof s);
        for (int i = 1; i <= n; i ++ ) s[i] = s[i - 1] + d[i];
        for (int i = 1; i <= n; i ++ ) f[i][i] = 0;
        
        for (int len = 2; len <= n; len ++ )
            for (int i = 1; i + len - 1 <= n; i ++ )
            {
                int j = i + len - 1;
                f[i][j] = 0x3f3f3f3f;
                for (int k = i; k <= j; k ++ )
                {
                    int w = (k - i) * d[i] + (k - i + 1) * (s[j] - s[k]);
                    f[i][j] = min(f[i][j], f[i + 1][k] + f[k + 1][j] + w);
                }
                /*
                for (int k = 1; k <= len; k ++ )
                {
                    int w = d[i] * (k - 1) + k * (s[j] - s[i + k - 1]);
                    f[i][j] = min(f[i][j], f[i + 1][i + k - 1] + f[i + k][j] + w);
                } 
                */
            }
        
        printf("Case #%d: %d\n", t ++, f[1][n]);
    }
    
    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/121607397