Pagini recente » Cod sursa (job #3207760) | Cod sursa (job #3283795) | Cod sursa (job #3288676) | Cod sursa (job #3280225) | Cod sursa (job #369770)
Cod sursa(job #369770)
#include<fstream>
#include<iostream>
#include<queue>
#include<string>
using namespace std;
fstream in("podm.in",ios::in);
fstream out("podm.out",ios::out);
int v[501];
long long mat[500][500];
int main()
{
int n;
in>>n;
for(int i=0; i<n+1; i++) in>>v[i];
for(int i=0; i<n; i++) mat[i][i] = 0;
for(int i=0; i<n-1; i++) mat[i][i+1] = v[i]*v[i+1]*v[i+2];
for(int i=n-1; i>=0; i--)
for(int j=i+2; j<n; j++)
{
mat[i][j] = -1;
for(int k=i; k<j; k++)
{
long long aux = mat[i][k] + mat[k+1][j] + v[i]*v[k+1]*v[j+1];
if( mat[i][j] == -1 || mat[i][j] > aux )
// cout << i << j << k << " "<<mat[i][k]<<" "<<mat[k+1][j]<<" "<<v[i]*v[k+2]*v[j+1]<<endl;
mat[i][j] = aux;
}
}
out<<mat[0][n-1]<<endl;
return 0;
}