CCPC 2021 Online - F Review: Fixed-Pattern Subsequence DP and Partitioning Contributions
Classify fragrant subsequences by the final h of nunhehheh, count prefix choices with fixed-pattern subsequence DP, then multiply by the nonempty choices of su…
Luogu P1121 Review: Maximum Sum of Two Circular Subarrays and Circular DP
A review of Luogu P1121, using case analysis and a complementary formulation to turn a circular selection problem into linear DP, with an analysis and fix for…
Luogu P1133 Review: From Linear DP to Cutting the Circle into a Line
A review of Luogu P1133, the Leader's Garden: starting with an incorrect linear DP model, examining the limits of patching circular constraints afterward, and…
Luogu P1637 / SPOJ SP2815 INCSEQ Review: A Fenwick-Tree Template for Strictly Increasing Subsequences of Length k
Starting with increasing triples in Luogu P1637 and extending to strictly increasing subsequences of length k in SPOJ INCSEQ, this review develops a general ap…