Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #1793871)
Utilizator | Data | 31 octombrie 2016 17:10:42 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int NMax = 505;
const long long oo = 1LL<<60;
long long DP[NMax][NMax];
int N,D[NMax];
void Read()
{
fin>>N;
for(int i = 0; i <= N; ++i)
fin>>D[i];
}
void Solve()
{
for(int Step = 1; Step < N; ++Step)
{
for(int i = 1; i <= N - Step; ++i)
{
int j = i + Step;
DP[i][j] = oo;
for(int k = i; k < j; ++k)
{
DP[i][j] = min(DP[i][j],DP[i][k]+DP[k+1][j]+1LL*D[i-1]*D[k]*D[j]);
}
}
}
}
void Print()
{
fout<<DP[1][N]<<"\n";
}
int main()
{
Read();
Solve();
Print();
return 0;
}