Pagini recente » Atasamentele paginii Clasament tsojiround | Istoria paginii utilizator/deian | Diferente pentru onis-2015/solutii-runda-1 intre reviziile 106 si 35 | Istoria paginii utilizator/natydog | Cod sursa (job #2003003)
#include <iostream>
#include <bits/stdc++.h>
#define NMAX 600
#define INFILE "podm.in"
#define OUTFILE "podm.out"
using namespace std;
ifstream in(INFILE);
ofstream out(OUTFILE);
int P[NMAX];
int m[NMAX][NMAX];
int N(0);
void Read(){
in>>N;
N++;
for(int i=0;i<N;i++)
in>>P[i];
}
void MinimInmultiri(){
for(int l=2;l<=N;l++){
for(int i=1;i<=N-l+1;i++){
int j=i+l-1;
m[i][j]=INT_MAX;
int q(0);
for(int k=i;k<j;k++){
q=m[i][k]+m[k+1][j]+P[i-1]*P[k]*P[j];
if(m[i][j]>q){
m[i][j]=q;
}
}
}
}
}
int main()
{
Read();
MinimInmultiri();
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
cout<<m[i][j]<<" ";
}
cout<<endl;
}
out<<m[1][N-1];
return 0;
}