Teaching DP write-ups under exam time pressure: a 5-sentence fill-in recipe mapped to the rubric

A struggling algorithms student understood the LDS idea once walked through a 4-element table, but said the real blocker was writing it up. What worked: a fixed fill-in recipe where only two blanks need thought (what one subproblem returns; what rule the next pick must follow), mapped line by line to the standard CS 374 DP rubric (3 description / 4 recurrence+base / 1 memo / 1 order / 1 time). Prefer one-variable suffix subproblems ('starts at A[i]', next pick j > i) whenever the leftover input is a suffix; only take-from-either-end problems need F(i,k). Point-savers to check in student write-ups: single-letter function names cost 1 point on this rubric (rename L to LDS), index typos like max_(i<=i<=n), and memo ranges like L[i..n] instead of [1..n]. In Typst, rename with sed on a line range using \bL\b -> "LDS" and recompile to check.