Pagini recente » Cod sursa (job #2229911) | Cod sursa (job #2701063) | Cod sursa (job #3163388) | Cod sursa (job #728891) | Cod sursa (job #3201198)
#include <stdio.h>
#include <stdlib.h>
#define N 500
#define INF (1LL << 60)
int dim[N+1];
long long nr[N+1][N+1];
long long min(long long x, long long y)
{
return (x < y ? x : y);
}
int main()
{
FILE *in, *out;
in = fopen("podm.in", "r");
out = fopen("podm.out", "w");
int n;
fscanf(in, "%d", &n);
for (int i = 0; i <= n; i++)
{
fscanf(in, "%d", &dim[i]);
}
for (int i = n; i >= 1; i--)
{
nr[i][i] = 0;
for (int j = i + 1; j <= n; j++)
{
nr[i][j] = INF;
for (int k = i; k < j; k++)
{
nr[i][j] = min(nr[i][j],
nr[i][k] + nr[k+1][j] + (long long)dim[i-1]*dim[k]*dim[j]);
}
}
}
fprintf(out, "%lld\n", nr[1][n]);
fclose(in);
fclose(out);
return 0;
}