Pagini recente » Cod sursa (job #1522992) | Cod sursa (job #325080) | Cod sursa (job #49984) | Cod sursa (job #2760211) | Cod sursa (job #2854891)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int NMax = 501;
const int inf = 0x3f3f3f3f;
int N;
int d[NMax];
int dp[NMax][NMax];
int main()
{
fin >> N;
for(int i = 0; i <= N; i++){
fin >> d[i];
}
for(int i = 1; i <= N; i++){
dp[i][i] = 0;
for(int j = i + 1; j <= N; j++){
dp[i][j] = inf;
}
}
for(int step = 1; step <= N - 1; step++){
for(int i = 1; i <= N - step; i++){
int j = i + step;
for(int k = i; k < j; k++){
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] +
d[i - 1] * d[k] * d[j]);
}
}
}
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++){
fout << dp[i][j] << " ";
}
fout << "\n";
}
return 0;
}