ocaml: phase 5.1 palindrome_part.ml baseline (min cuts "aabba" = 1)

Two-phase palindrome-partition DP for the minimum-cuts variant:

  Phase 1: is_pal[i][j] palindrome table via length-major fill
           (single chars, then pairs, then expand inward).

  Phase 2: cuts[i] = 0 if s[0..i] is itself a palindrome,
                  = min over j of (cuts[j-1] + 1)
                    where s[j..i] is a palindrome.

  min_cut "aabba" = 1   ("a" | "abba")

Tests two sequential 2D DPs sharing the same is_pal matrix,
inline begin/end branches inside the length-major fill, mixed
bool and int 2D arrays.

181 baseline programs total.

lib/ocaml/baseline/expected.json

@@ -125,6 +125,7 @@
   "mutable_record.ml": 10,
   "option_match.ml": 5,
   "palindrome.ml": 4,
+  "palindrome_part.ml": 1,
   "palindrome_sum.ml": 49500,
   "paren_depth.ml": 7,
   "partition.ml": 3025,