Pagini recente » Cod sursa (job #677552) | Cod sursa (job #1303515) | Cod sursa (job #355858) | Monitorul de evaluare | Cod sursa (job #1259333)
#include<fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
const int nmax = 506;
long long v[nmax], n;
long long d[nmax][nmax];
int main(){
int player_unu=0;
in>>n;n++;
for(int i = 1; i<=n; i++)
in>>v[i];
for(int i = 0; i<=n; i++)
for(int j = i + 1; j<=n; j++)
d[i][j] = 10000000000000000;
for(int len = 2; len<n; len++)
{
for(int i = 1; i<n + 1 - len; i++)
{
int j = i + len - 1;
for(int k = i; k<j; k++)
d[i][j] = min(d[i][j], d[i][k] + d[k + 1][j] + v[i] * v[k + 1] * v[j + 1]);
}
}
out<<d[1][n - 1];
return player_unu;
}