Pagini recente » Cod sursa (job #93948) | Cod sursa (job #97020) | Cod sursa (job #2719814) | Cod sursa (job #1787220) | Cod sursa (job #1109566)
#include <fstream>
using namespace std;
int N,A[505];
long long D[505][505];
void citire();
int main()
{
citire();
for( int i=N; i>=1; --i){
D[i][i]=0;
if( i < N ) {D[ i ][ i+1 ] = A[ i-1 ] * A[ i ] * A[ i+1 ]; }
for(int j=i+2; j<=N ; ++j){
D[i][j]= 0x3f3f3f3f;
for(int k=i; k<j; ++k)
D[i][j]=min( D[i][j] , D[i][k] + D[k + 1][j] + A[i - 1] * A[k] * A[j] );
}
}
ofstream g("podm.out");
g<<D[1][N];
g.close();
return 0;
}
void citire(){
ifstream f("podm.in");
f>>N;
for( int i=0;i<=N;++i){
f>>A[i];
}
f.close();
}