Cod sursa(job #2545339)
| Utilizator | Data | 12 februarie 2020 23:34:11 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long d[504][504],a[504],n,j,p;
int main()
{
fin>>n;
n++;
for(long long i=1;i<=n;i++)
fin>>a[i];
for(long long len=3;len<=n;len++)
{
for(long long i=1;i<=n-len+1;i++)
{
j=len+i-1;
d[i][j]=1000000000;
for(long long m=i+1;m<j;m++)
{
p=d[i][y]+d[y][j]+a[i]*a[y]*a[j];
d[i][j]=min(d[i][j],p);
}
}
}
fout<<d[1][n];
return 0;
}
