题目列表
显示 43 / 646 道可提交题。 当前筛选:标签:Dynamic Programming,权限:免费
Binary-State Strategy — Best PnL With Post-Exit Cooldown
Bounded K Transactions: 2D DP for Maximum Profit
Multi-Strike Portfolio with Per-Strike Share Cap (Bounded Knapsack)
Best Realized PnL Bound Under K Disjoint Round-Trips with Per-Roundtrip Impact Cost
Conditional Scenario-Tree Probability-Weighted PnL Aggregation
Cumulative Default Probability from Marginal Hazard Rates: Term-Structure Composition
Sequenced Limit Orders — Earliest K-th Fire Day With Per-Order Threshold And Cooldown Gap
Budget-Constrained Ticker Selection (0/1 Knapsack)
Longest Stair-Stepping Subsequence Of Cumulative-PnL Reports Under A Minimum-Gain Gate
Longest Sub-Window Beating a PnL Target via Monotonic-Stack on Prefix Sums
Marginal Default Probability from a Cumulative-PD Term Structure: Inverse Bootstrap
Maximum Cumulative Carry Under a Bounded Sign-Flip Budget
Maximum Realised Cumulative Return When Allowed To Skip At Most K Periods
Winning-Streak Counting — Maximum Disjoint Positive-Sum Runs of Minimum Length
Maximum Grid PnL Path With At-Most-K Cell Skips (Right/Down)
Max-Reward Sequence Alignment Across Trade-Action Streams
Maximum Total Reward From Timestamped Trade Candidates Under A Compliance Hold-Period Gap
Three-State Action Path — Max Cumulative Reward With Flat Per-Flip Switching Penalty
Max Sum of a Min-Step-Monotone Reward Subsequence (Stair-Step PnL Ceiling)
Best Single Round-Trip Realized PnL Under a Minimum-Holding-Period Compliance Rule
Tear-Sheet Bucketing — Fewest Strictly-Positive-Sum Cover Chunks With Per-Block Length Cap
Pairwise Rating-Transition Probability at Horizon: Single Entry of Markov Chain M^H
Whole-Share Portfolio Allocator under a Single-Name Cap
Multi-Step Rating Distribution Propagation: Markov Transition Forward H Steps
Sticky Binary-State Strategy — Best PnL With Per-Flip Tax And Initial-State Anchor
Two-Budget Strike-Premium Knapsack (Delta and Vega Caps)
Weighted-Cost Edit Distance Between Trade-Action Paths