Cod sursa(job #3140735)
| Utilizator | Data | 9 iulie 2023 11:19:37 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream F("podm.in");
ofstream G("podm.out");
long long i,j,k,a[501][501],n,d[501];
int main()
{
for(F>>n;i<=n;F>>d[i++]);
for(i=1;i<n;a[i][i+1]=d[i-1]*d[i]*d[i+1],++i);
for(k=2;k<n;++k)
for(i=1;i<=n-k;++i)
for(a[i][i+k]=1e18,j=i;j<=i+k;a[i][i+k]=min(a[i][i+k],a[i][j]+a[j+1][i+k]+d[i-1]*d[j]*d[i+k]),++j);
return G<<a[1][n],0;
}
