Cod sursa(job #1135280)
| Utilizator | Data | 7 martie 2014 16:58:10 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define INF 4000000000
using namespace std;
unsigned int d[501],dp[501][501];
ifstream fin("podm.in");
ofstream fout("podm.out");
int main()
{
size_t n,step,i,j,k;
fin>>n;
for(i=0;i<=n;++i)
fin>>d[i];
for(step=1;step<n;++step)
for(i=1;i<=n-step;++i)
{
j=i+step;
dp[i][j]=INF;
for(k=i;k<j;++k)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+d[i-1]*d[k]*d[j]);
}
fout<<dp[1][n]<<"\n";
return 0;
}
