Pagini recente » Cod sursa (job #2106068) | Cod sursa (job #1289009)
#include <fstream>
#define INF 200000000
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long n, m, i, j, k, ok ,minim, maxim;
long long a[505][505], v[505], d;
int minimal(int a, int b){
if(a < b)
return a;
else
return b;
}
void set(){
for(d = 2; d <= n - 1; d ++){
for(i = 1; i + d <= n; i ++){
j = i + d;
a[i][j] = INF;
for(k = i + 1; k <= j - 1; k ++)
a[i][j] = minimal(a[i][j], (a[i][k] + a[k][j] + (v[i] * v[k] * v[j])));
}
}
return;
}
void write(){
fout << a[1][n] << "\n";
return;
}
void read(){
fin >> n; n ++;
for(i = 1; i <= n; i ++)
fin >> v[i];
return;
}
int main(){
read();
set();
write();
return 0;
}