Pagini recente » Cod sursa (job #2507681) | Cod sursa (job #612222) | Cod sursa (job #553190) | Cod sursa (job #2811915) | Cod sursa (job #2853642)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("podm.in");
ofstream g ("podm.out");
int n;
int v[501];
int dp[501][501];
void citire()
{
f >> n;
for(int i = 1;i<=n+1;i++)
{
f >> v[i];
}
}
void dp1()
{
int dif = 1,i=1,j;
while(dif<=n-1)
{
i = 1;
while(i<=n-dif)
{
j = i+dif;
for(int intermediar = i;intermediar<j;intermediar++)
{
if(dp[i][j] == 0)
{
dp[i][j] = dp[i][intermediar] + dp[intermediar+1][j] + (v[i]*v[intermediar+1]*v[j+1]);
}
else
{
dp[i][j] = min( dp[i][j],dp[i][intermediar] + dp[intermediar+1][j] + (v[i]*v[intermediar+1]*v[j+1]));
}
}
i++;
}
dif++;
}
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=n;j++)
cout << dp[i][j]<< " ";
cout << endl;
}
}
int main()
{
citire();
dp1();
}