Pagini recente » Cod sursa (job #1282247) | Atasamentele paginii Clasament gggg | Monitorul de evaluare | Cod sursa (job #1799460) | Cod sursa (job #1356544)
#include <fstream>
using namespace std;
long long m[501][501], d[502];
inline long long sol(int i, int j)
{
if(i==j)
return 0;
if(m[i][j])
return m[i][j];
int k;
m[i][j]=1000000000000000LL;
for(k=i; k<j; k++)
m[i][j]=min(m[i][j], sol(i, k)+sol(k+1, j)+d[i-1]*d[k]*d[j]);
return m[i][j];
}
int main()
{
int i, n;
ifstream f("podm.in");
ofstream g("podm.out");
f>>n;
for(i=0; i<=n; i++)
{
f>>d[i];
}
g<<sol(1, n);
}