Pagini recente » Cod sursa (job #2021478) | Cod sursa (job #2738313) | Cod sursa (job #1931746) | Cod sursa (job #2498539) | Cod sursa (job #2221341)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("podm.in");
ofstream g ("podm.out");
long long v[505], a[505][505];
const long long oo=1LL<<62;
int main()
{
long long i, n, l, j, k, q;
f>>n;
for(i=1; i<=n+1; i++)
f>>v[i];
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(i<j) a[i][j]=oo;
for(l=2; l<=n+1; l++)
{
for(i=1; i<=n+1-l; i++)
{
j=i+l-1;
for(k=i; k<=j-1; k++)
{
q=a[i][k]+a[k+1][j]+v[i]*v[k+1]*v[j+1];
if(q<a[i][j]) a[i][j]=q;
}
}
}
g<<a[1][n];
return 0;
}