【TYVJ P1014】乘法游戏
6
10 1 50 50 20 5
3650
1 #include<cstdio> 2 #include<cstring> 3 #include<iostream> 4 #include<algorithm> 5 #include<cstdlib> 6 using namespace std; 7 8 long long f[105][105]; 9 int a[105]; 10 int n; 11 12 int main() 13 { 14 scanf("%d", &n); 15 for (int i = 0; i < n; ++i) 16 scanf("%d", &a[i]); 17 memset(f, 0x7f, sizeof(f)); 18 f[0][0] = f[n - 1][n - 1] = 0; 19 for (int i = 1; i < n - 1; ++i) f[i][i] = a[i - 1] * a[i] * a[i + 1]; 20 for (int i = 1; i < n - 2; ++i) 21 f[i][i + 1] = min(f[i][i] + f[i + 1][i + 1] / a[i] * a[i - 1], f[i + 1][i + 1] + f[i][i] / a[i + 1] * a[i + 2]); 22 for (int i = 1; i < n; ++i) 23 for (int j = 0; j < i; ++j) 24 f[i][j] = 0; 25 for (int i = n - 2; i > 0; --i) 26 for (int j = i + 1; j < n - 1; ++j) 27 for (int k = i; k <= j; ++k) 28 f[i][j] = min(f[i][j], f[i][k - 1] + f[k + 1][j] + a[i - 1] * a[k] * a[j + 1]); 29 cout << f[1][n - 2] << endl; 30 //system("pause"); 31 return 0; 32 }优质内容筛选与推荐>>