Cod sursa(job #787123)
| Utilizator | Data | 12 septembrie 2012 17:15:07 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
long long n, i, dim[501], bun, minim, solFin, j;
int main()
{
ifstream f("podm.in");
ofstream g("podm.out");
f>>n;
for(i=1; i<=n+1; i++)
{
f>>dim[i];
}
while(n>1)
{
minim=100000000000LL;
for(i=1; i<n; i++)
{
if(dim[i]*dim[i+1]*dim[i+2]<minim)
{
minim=dim[i]*dim[i+1]*dim[i+2];
bun=i;
}
}
solFin+=minim;
for(j=bun+2; j<=n+1; j++)
{
dim[j-1]=dim[j];
}
n--;
}
g<<solFin;
}