Cod sursa(job #2508852)

Utilizator popashtefan10Popa Stefan popashtefan10 Data 13 decembrie 2019 10:16:54
Problema Parantezare optima de matrici Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.97 kb
#include <iostream>
#include <cstdio>
#define NMAX 500

using namespace std;

int n;
long long dim[NMAX + 5];
long long d[NMAX + 5][NMAX + 5], path[NMAX + 5][NMAX + 5];

int main() {
  freopen("podm.in", "r", stdin);
  freopen("podm.out", "w", stdout);
  long long val;

  scanf("%d", &n);
  for(int i = 0; i <= n; i++)
    scanf("%d", &dim[i]);

  for(int j = 0; j < n; j++)
    for(int i = 1; i <= n && i + j <= n; i++) /// parantezam secventa [i, i + j]
      if(j == 0)
        d[i][i] = 0;
      else if(j == 1)
        d[i][i + 1] = dim[i - 1] * dim[i] * dim[i + 1];
      else {
        d[i][i + j] = 1.e18;
        for(int k = i; k <= i + j - 1; k++) { /// inmultim secventele [i, k] si [k + 1, j]
          val = d[i][k] + d[k + 1][i + j] + dim[i - 1] * dim[k] * dim[i + j];
          if(val < d[i][i + j]) {
            d[i][i + j] = val;
            path[i][i + j] = k;
          }
        }
      }

  printf("%lld", d[1][n]);

  return 0;
}