Cod sursa(job #1804466)
Utilizator | Data | 12 noiembrie 2016 16:47:03 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n,i,j,k;
long long d[501],dp[501][501];
int main()
{
f>>n;
for(i=0;i<=n;++i) f>>d[i];
for(i=1;i<n;++i)
for(j=i+1;j<=n;++j)
{
dp[j-i][j]=1LL<<60;
for(k=j-i;k<j;++k)
dp[j-i][j]=min(dp[j-i][j],dp[j-i][k]+dp[k+1][j]+d[j-i-1]*d[k]*d[j]);
}
g<<dp[1][n];
return 0;
}