Cod sursa(job #2954159)
Utilizator | Data | 13 decembrie 2022 13:22:40 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream F("podm.in");
ofstream G("podm.out");
long long i,j,k,m[501][501],d[501],n;
int main()
{
for(F>>n;i<=n;F>>d[i++]);
for(j=2;j<n;++j)
for(i=1;i<=n-j;++i)
for(m[i][i+j]=1e18,k=i;k<i+j;m[i][i+j]=min(m[i][i+j],m[i][k]+m[k+1][i+j]+d[i-1]*d[k]*d[i+j]),++k);
return G<<m[1][n],0;
}