giles
73efd229be
Test, Build, and Deploy / test-build-deploy (push) Failing after 26s
ocaml: phase 5.1 house_robber.ml baseline (max non-adjacent sum = 22)
Classic House Robber linear DP:
dp[i] = max(dp[i-2] + houses[i], dp[i-1])
For [2; 7; 9; 3; 1; 5; 8; 6]:
dp = [2, 7, 11, 11, 12, 16, 20, 22]
max sum = 22
Optimal pick is {indices 0, 2, 5, 7}: 2 + 9 + 5 + 6 = 22 (all
non-adjacent).
Tests linear DP with early-return edge cases for n=0 and n=1,
inline-if rhs for max-of-two, dual look-back into dp[i-2] and
dp[i-1].
189 baseline programs total.
2026-05-11 03:34:48 +00:00
..
2026-05-07 19:33:09 +00:00
2026-05-06 23:00:12 +00:00
2026-05-06 22:01:51 +00:00
2026-05-01 23:30:48 +00:00
2026-05-07 19:45:10 +00:00
2026-05-06 22:46:48 +00:00
2026-05-07 01:20:32 +00:00
2026-05-01 22:33:27 +00:00
2026-05-07 17:17:17 +00:00
2026-05-11 03:34:48 +00:00
2026-05-07 17:35:49 +00:00
2026-05-01 23:18:04 +00:00
2026-05-06 22:01:51 +00:00
2026-05-07 18:29:26 +00:00
2026-04-02 12:50:35 +00:00
2026-04-03 21:48:54 +00:00
2026-04-03 21:48:54 +00:00
2026-05-07 02:38:47 +00:00
2026-04-03 21:48:54 +00:00
2026-05-06 16:58:18 +00:00
2026-04-04 20:49:02 +00:00
2026-04-22 09:08:00 +00:00
2026-04-22 09:08:00 +00:00
2026-04-04 20:49:02 +00:00
2026-04-11 08:03:45 +00:00
2026-05-01 21:00:22 +00:00
2026-04-03 21:48:54 +00:00
2026-04-11 08:19:16 +00:00
2026-04-03 21:48:54 +00:00
2026-04-04 20:49:02 +00:00
2026-04-12 18:31:34 +00:00
2026-04-04 20:49:02 +00:00
2026-04-04 20:49:02 +00:00
2026-04-08 10:12:57 +00:00