Mai intai trebuie sa te autentifici.
Cod sursa(job #1795870)
Utilizator | Data | 2 noiembrie 2016 21:54:09 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.03 kb |
#include <cstdio>
#include <climits>
using namespace std;
const long long inf = LONG_LONG_MAX;
long long n;
long long numere[505];
long long mat[505][505];
void citire()
{
scanf("%lld", &n);
for(long long i = 0; i <= n; i++)
{
scanf("%lld", &numere[i]);
}
}
void dinamic()
{
for(long long y = 1; y < n; y++)
{
long long i = 1;
long long j = y + 1;
while(j <= n)
{
long long minim = inf;
for(long long k = i; k < j; k++)
{
long long tmp = mat[i][k] + mat[k + 1][j] + numere[i - 1] * numere[k] * numere[j];
if(tmp < minim)
{
minim = tmp;
}
}
mat[i][j] = minim;
i++;
j++;
}
}
printf("%lld", mat[1][n]);
}
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
citire();
dinamic();
return 0;
}