Mai intai trebuie sa te autentifici.
Cod sursa(job #2227769)
Utilizator | Data | 1 august 2018 17:53:23 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n;
long long dp[510][510],a[510];
void fct()
{
int x,y;
for(int i=1;i<=n;i++)
for(int j=1;j+1<=n;j++)
{
x=j;
y=i+j;
long long mini=(1LL<<60);
for(int k=x;k<y;k++)
if(mini>dp[x][k]+dp[k+1][y]+a[x]*a[k+1]*a[y+1])
mini=dp[x][k]+dp[k+1][y]+a[x]*a[k+1]*a[y+1];
dp[x][y]=mini;
}
}
int main()
{
ifstream fin("podm.in");
fin>>n;
for(int i=1;i<=n+1;i++)
fin>>a[i];
fct();
ofstream fout("podm.out");
fout<<dp[1][n];
return 0;
}