Cod sursa(job #2497905)
| Utilizator | Data | 23 noiembrie 2019 12:09:06 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
const long long INF = 1LL << 60;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long a[501], dp[501][501];
int main()
{
int n;
fin>>n;
for(int i=1; i<=n+1; i++)
fin>>a[i];
for(int i=n; i>=1; i--)
for(int j=i+1; j<=n; j++)
{
long long minn=INF;
for(int k=i; k<j; k++)
{
if(dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1]<minn)
minn=dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1];
}
dp[i][j]=minn;
}
fout<<dp[1][n];
return 0;
}
