Pagini recente » Cod sursa (job #1042652) | Cod sursa (job #2332800) | Cod sursa (job #3180967) | Cod sursa (job #67239) | Cod sursa (job #2493226)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n;
int dp[505][505], a[505];
pair<int,int>mat[505];
void solve()
{
int st, dr;
int mini;
for (int k=1; k<n; ++k)
{
for (int i=1; i+k<=n; ++i)
{
st=i;
dr=i+k;
mini=0x3f3f3f3f;
for (int t=st; t<dr; ++t)
{
mini=min(mini,dp[st][t]+dp[t+1][dr]+a[st]*a[t+1]*a[dr+1]);
}
dp[st][dr]=mini;
}
}
g << dp[1][n];
}
int main()
{
f >> n;
f >> mat[1].first >> mat[1].second;
a[1]=mat[1].first;
a[2]=mat[1].second;
for(int i=2; i<=n; ++i)
{
mat[i].first=mat[i-1].second;
f >> mat[i].second;
a[i+1]=mat[i].second;
}
solve();
return 0;
}