Cod sursa(job #520021)
Utilizator | Mihai-Alexandru Dusmanu dushmi | Data | 7 ianuarie 2011 12:10:51 |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#define LL long long
using namespace std;
int n;
LL q,a[502],d[502][502];
ifstream f("podm.in");
ofstream g("podm.out");
int main()
{
f>>n;
for(int i=1;i<=n+1;i++)
f>>a[i];
for(int i=n;i>=1;i--)
for(int j=i+1;j<=n;j++)
{
d[i][j]=d[i][i]+d[i+1][j]+a[i]*a[i+1]*a[j+1];
for(int k=i+1;k<j;k++)
{
q=d[i][k]+d[k+1][j]+a[i]*a[k+1]*a[j+1];
if(q<d[i][j])
d[i][j]=q;
}
}
g<<d[1][n];
return 0;
}