动态规划-矩阵连乘
发布日期:2021-05-07 09:08:49 浏览次数:16 分类:精选文章

本文共 982 字,大约阅读时间需要 3 分钟。

#define CRT_SECURE_NO_WARNINGS#include 
using namespace std;int n;int p[101];int m[101][101];int s[101][101];void MatrixChain() { for (int i = 0; i <= n; i++) { cin >> p[i]; } for (int i = 1; i <= n; i++) { m[i][i] = 0; } for (int r = 2; r <= n; r++) { for (int i = 1; i <= n - r + 1; i++) { int j = i + r - 1; m[i][j] = m[i + 1][j] + p[i - 1] * p[i] * p[j]; s[i][j] = i; for (int k = i + 1; k < j; k++) { int tmp = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]; if (tmp < m[i][j]) { m[i][j] = tmp; s[i][j] = k; } } } }}void printm() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cout.width(7); cout << m[i][j] << " "; } cout << endl; }}void prints() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cout.width(7); cout << s[i][j] << " "; } cout << endl; }}int main() { cin >> n; MatrixChain(); printm(); cout << endl << endl << endl; prints(); return 0;}
上一篇:Java-java语言概述和入门程序
下一篇:Java入门学习-nefu瑞格练习6

发表评论

最新留言

路过,博主的博客真漂亮。。
[***.116.15.85]2025年04月05日 09时59分34秒