Pagini recente » Cod sursa (job #813372) | Cod sursa (job #443548) | Cod sursa (job #35114) | Cod sursa (job #2836313) | Cod sursa (job #2180278)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long n, a[505],dp[505][505], t, mini,rez;
void dinamic()
{
t=1;
for (t=1;t<=n;t++)
{
for (int i=1; i<=n-t; i++)
{
mini=(1LL<<60);
for (int k=i; k<i+t; k++)
{
rez=0;
rez+=dp[i][k]+dp[k+1][i+t]+(a[i-1]*a[k]*a[i+t]);
if (rez<mini)
mini=rez;
}
dp[i][i+t]=mini;
// dp[i][i+t]=1;
}
}
g << dp[1][n];
}
int main()
{
f >> n;
for (int i=0; i<=n; i++)
{
f >> a[i];
dp[i][i]=0;
}
dinamic();
return 0;
}