Pagini recente » Borderou de evaluare (job #1761036) | Cod sursa (job #2072898) | Concursuri organizate de infoarena | Cod sursa (job #2031570) | Cod sursa (job #2259314)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int N = 501;
int n,i,st,dr,mi;
long long d[N],D[N][N];
int main()
{
fin>>n;
for(i=0;i<=n;i++)
fin>>d[i];
for(i=2;i<=n;i++)
for(st=0,dr=i;dr<=n;st++,dr++)
{
mi=st+1;
D[st][dr]=D[st][mi]+D[mi][dr]+d[st]*d[mi]*d[dr];
for(;mi<dr;mi++)
D[st][dr]=min(D[st][dr],D[st][mi]+D[mi][dr]+d[st]*d[mi]*d[dr]);
}
fout<<D[0][n];
return 0;
}