算法导论 DP 矩阵链乘法

点击(此处)折叠或打开

1. #include <iostream>
   
2. #include <stdio.h>
   
3. #include<cstring>
   
4. 
   
5. using namespace std;
   
6. 
   
7. #define MAX_V 10
   
8. int P[MAX_V];
   
9. 
   
10. #define inf (2000000000)
    
11. 
    
12. int m[MAX_V][MAX_V],s[MAX_V][MAX_V];
    
13. int n;
    
14. 
    
15. void print(int i,int j)
    
16. {
    
17.     int k = s[i][j];
    
18.     
    
19.     if(i == j)
    
20.     {
    
21.         printf("A%d",i);
    
22.         return;
    
23.     }
    
24.     
    
25.     printf("(");
    
26.     print(i,k);
    
27.     print(k+1,j);
    
28.     printf(")");
    
29. 
    
30. }
    
31. 
    
32. void solve()
    
33. {
    
34.     int l=0;
    
35. 
    
36.     memset(m,0,sizeof(m));
    
37.     memset(s,0,sizeof(s));
    
38. 
    
39.     for(int i=1;i<=n;i++)
    
40.         m[i][i] = 0;
    
41. 
    
42.     for(l=2;l<=n;l++) // l is chain len
    
43.     {
    
44. 
    
45.         for(int i=1;i<=n-(l-1);i++)
    
46.         {
    
47.             int j=i+(l-1);
    
48.             int minl = inf;
    
49.             
    
50.             for(int k=i;k<j;k++)
    
51.             {
    
52.                 int kl = m[i][k] + m[k+1][j]+P[i-1]*P[k]*P[j];
    
53.                 if(kl < minl)
    
54.                 {
    
55.                     minl = kl;
    
56.                     s[i][j] =k;
    
57.                 }
    
58.             }
    
59. 
    
60.             m[i][j] = minl;
    
61.         }
    
62.     }
    
63. 
    
64.     cout<<"min matrix * nums is :"<<m[1][n]<<endl;
    
65.     cout<<"min matrix * path is :"<<endl;
    
66.     print(1,n);
    
67. }
    
68. 
    
69. 
    
70. int main()
    
71. {
    
72.     cin>>n;
    
73.     for(int i=0;i<=n;i++)
    
74.         cin >> P[i];
    
75. 
    
76.     solve();
    
77. }

输入数据：

点击(此处)折叠或打开

1. 6
   
2. 30 35 15 5 10 20 25

<script type=text/javascript charset=utf-8 src="http://static.bshare.cn/b/buttonLite.js#style=-1&uuid=&pophcol=3&lang=zh"></script> <script type=text/javascript charset=utf-8 src="http://static.bshare.cn/b/bshareC0.js"></script>

阅读(3) | 评论(0) | 转发(0) |

0

上一篇：poj 2251

下一篇：将博客搬至CSDN

相关热门文章

• linux 常见服务端口
• 【ROOTFS搭建】busybox的httpd...
• 什么是shell
• linux socket的bug??
• linux的线程是否受到了保护？...

• cpu %和load average是怎样的...
• 如何确定线程使用的端口...
• mysql整形数据类型插入0001数...
• weblogic集群下启动服务有一个...
• Ajax 权限验证

给主人留下些什么吧！~~

评论热议