Cod sursa(job #921727)
| Utilizator | Data | 21 martie 2013 11:54:17 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long n, p[505], m[505][505], s[505][505];
int main()
{
fin>>n;
for(int i=0; i<=n; i++)
fin>>p[i];
for(int l=2; l<=n; l++)
for(int i=1; i<=n-l+1; i++){
int j = i+l-1;
m[i][j] = INF;
for(int k=i; k<=j-1; k++){
long long q = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j];
if(q < m[i][j]){
m[i][j] = q;
s[i][j] = k;
}
}
}
fout<<m[1][n];
return 0;
}
