抱歉,上面打错了,解法是(4 \* 9 \* 7) \* (0 \* 3 \* 8 \* 0 \* 5 \* 0 \* 0 + 5 \* 4)
by _J_C_ @ 2018-03-14 18:38:09
@[GJCPP](/space/show?uid=33173) 无误
by yjjr @ 2018-03-14 22:03:24
。。那麻烦看一下我的数据吧。 @[yjjr](/space/show?uid=5088)
by _J_C_ @ 2018-03-15 14:49:20
难道是因为这道题做的人少,又都AC了,就不来管我了?还是因为管理员自己交了AC了就不来管我给出的样例了?这么不负责任的吗?
12 10
4 9 7 0 3 8 0 5 0 0 5 4
我再说一下,上面这个点你们给出的答案是0,而我给出的是5040,事实上这个点存在以下解法:
(4 \* 9 \* 7) \* (0 \* 3 \* 8 \* 0 \* 5 \*0 \* 0 + 5 \* 4) = 252 \* 20 = 5040
如果我的解法有问题,请指出来,我非常抱歉;如果没有,请尽快改正你们的数据,我非常感激。
by _J_C_ @ 2018-03-19 20:41:23
@[GJCPP](/space/show?uid=33173)
我也觉得有误 ,我跑出来也是5040
by 和其正 @ 2018-05-02 10:18:39
@[老K](/space/show?uid=8943)
@[kkksc03](/space/show?uid=1)
```cpp
#include<bits/stdc++.h>
#define gc getchar
#define ll long long
inline ll read(){ll x = 0; char ch = gc(); bool positive = 1;for (; !isdigit(ch);
ch = gc()) if (ch == '-') positive = 0;for (; isdigit(ch); ch = gc()) x = x * 10
+ ch - '0';return positive ? x : -x;}inline void write(ll a){if(a>=10)write(a/10);
putchar('0'+a%10);}inline void writeln(ll a){if(a<0){a=-a; putchar('-');}write(a);
puts("");}
using namespace std;
const int N = 20;
int n, m, sum[N];
ll f[N][N][N];
int main() {
n = read(), m = read();
for(int i = 1; i <= n; ++i)
sum[i] = sum[i - 1] + read();
for(int i = 1; i <= n; ++i)
for(int j = i ; j<= n; ++j)
f[i][j][0] = sum[j] - sum[i - 1];
for(int l = 1; l <= m; ++l)
for(int len = 2; len <= n; ++len)
for(int i = 1; i + len - 1 <= n; ++i) {
int j = i + len - 1;
for(int k = i; k < j; ++k)
for(int o = 1; o <= min(k - i + 1, l); ++o) {
f[i][j][l] = max(f[i][j][l], f[i][k][o] + f[k + 1][j][l - o]);
f[i][j][l] = max(f[i][j][l], f[i][k][o - 1] * f[k + 1][j][l - o]);
}
}
writeln(f[1][n][m]);
return 0;
}
```
by 和其正 @ 2018-05-02 10:22:58
@[kkksc03](/space/show?uid=1) 数据有误,我来冒个泡
by 曦行夜落 @ 2018-07-26 14:12:37
@[chen_zhe](/space/show?uid=8457) @[yjjr](/space/show?uid=5088) @[FlierKing](/space/show?uid=9433)
by 曦行夜落 @ 2018-07-26 14:18:36
@[GJCPP](/space/show?uid=33173) 数据已经加强
by 曦行夜落 @ 2018-07-26 14:20:52
对不起,艾特了这么多管理员,打扰了
by 曦行夜落 @ 2018-07-26 14:21:09