NYOJ536
题解:
-
Ai = pi-1 * pi
-
f(i,j) = min{f(i,k) + f(k+1,j) + pi-1*pk*pj}
代码1:记忆化搜索
#include <bits/stdc++.h>
using namespace std;
int const inf = 0x7f7f7f7f;
int const N = 100 + 10;
int n,p[N],dp[N][N];
int DP(int l,int r){
if(l == r) return 0;
int &ans = dp[l][r];
if(ans > 0) return ans;
ans = inf;
for(int k=l;k<=r;k++)
ans = min(ans,DP(l,k) + DP(k+1,r) + p[l-1] * p[k] * p[r]);
return ans;
}
int main(){
while(cin>>n){
for(int i=1;i<=n;i++)
cin>>p[i-1]>>p[i]; //第i个矩阵为p[i-1]*p[i];
memset(dp,0,sizeof(dp));
int ans = DP(1,n);
cout<<ans<<endl;
}
}
代码2:递推
#include <bits/stdc++.h>
using namespace std;
int const inf = 0x7f7f7f7f;
int const N = 100 + 10;
int n,p[N],dp[N][N];
int main(){
while(cin>>n){
for(int i=1;i<=n;i++)
cin>>p[i-1]>>p[i]; //第i个矩阵为p[i-1]*p[i];
memset(dp,0,sizeof(dp));
for(int len=2;len<=n;len++) //枚举区间长度,区间长度为0没必要枚举,因为不用相乘就是0
for(int i=1;i+len-1<=n;i++){ //枚举起始长度
int j = i + len -1;
int &ans = dp[i][j];
ans = inf;
for(int k=i;k<j;k++)
ans = min(ans,dp[i][k] + dp[k+1][j] + p[i-1] * p[k] * p[j]);
}
cout<<dp[1][n]<<endl;
}
}
POJ1651
题解:
有n个数字相当于有n-1个矩阵相乘,和上面一模一样。
代码:
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <iostream>
using namespace std;
int const N = 100 + 10;
int const inf = 0x7f7f7f7f;
int dp[N][N];
int p[N],n;
int main(){
cin>>n; //n个数字,相当于又n-1个矩阵
for(int i=0;i<n;i++) cin>>p[i];
n--;
memset(dp,0,sizeof(dp));
for(int len=2;len<=n;len++){
for(int i=1;i+len-1<=n;i++){
int j = i + len - 1;
int &ans = dp[i][j];
ans = inf;
for(int k=i;k<j;k++)
ans = min(ans,dp[i][k] + dp[k+1][j] + p[i-1]*p[k]*p[j]);
}
}
cout<<dp[1][n]<<endl;
return 0;
}