Pagini recente » Cod sursa (job #2772616) | Cod sursa (job #2494371) | Cod sursa (job #2610763) | Cod sursa (job #2516334) | Cod sursa (job #562595)
Cod sursa(job #562595)
#include<fstream>
using namespace std;
long long a[505][505],n,i,j,k,mi;
int d[10003];
long long min(long long x,long long y)
{if(x>y) return y;
return x;}
int main()
{ifstream f("podm.in");
f>>n;
for(i=1;i<=n+1;i++)
{f>>d[i];
}
for(i=1;i<n;i++)
for(j=1;j<=n-i;j++)
{mi=1000000000;
for(k=j;k<j+i;k++)
mi=min(a[j][k]+a[k+1][j+i]+d[j]*d[k+1]*d[j+i+1]*1LL,mi);
a[j][j+i]=mi;
}
ofstream g("podm.out");
g<<a[1][n];
f.close();
g.close();
}