题目列表
显示 10 / 646 道可提交题。 当前筛选：标签：Optimization，难度：困难，权限：免费
提交状态：未尝试未正确已正确
状态题目难度权限语言
未尝试困难免费版Python / C++ / Rust
coding-bounded-k-transactions-2d-dp可练习
限次交易最优收益的 2D 动态规划Bounded K Transactions: 2D DP for Maximum Profit
未尝试困难免费版Python / C++ / Rust
coding-implied-vol-bisection可练习
Black-Scholes 隐含波动率：严格递增定价曲线上的二分反演Black-Scholes Implied Volatility on a Strictly Increasing Price Curve via Bisection
未尝试困难免费版Python / C++ / Rust
coding-max-carry-with-bounded-flip-count可练习
限定反转次数下的累计 carry 最大化Maximum Cumulative Carry Under a Bounded Sign-Flip Budget
未尝试困难免费版Python / C++ / Rust
coding-max-grid-pnl-path-with-k-skips可练习
最多跳过 K 格的网格 PnL 路径最大化（仅右/下行）Maximum Grid PnL Path With At-Most-K Cell Skips (Right/Down)
未尝试困难免费版Python / C++ / Rust
coding-max-reward-trade-action-alignment可练习
交易动作序列的最大奖励对齐Max-Reward Sequence Alignment Across Trade-Action Streams
未尝试困难免费版Python / C++ / Rust
coding-min-routers-binsearch-load-cap可练习
在 BFD 负载封顶分配器下二分搜索最小路由器数量Smallest Router Count under a BFD Load-Cap Assigner via Bisection
未尝试困难免费版Python / C++ / Rust
coding-min-stress-factor-keep-cp-within-cap可练习
最小压力情景严重度因子：首次有对手方击穿配额Smallest Stress Severity Factor Where a Counterparty First Breaches Its Cap
未尝试困难免费版Python / C++ / Rust
未尝试困难免费版Python / C++ / Rust
coding-two-budget-knapsack-strike-premium可练习
双约束下的行权 premium 配置（delta 与 vega 双预算）Two-Budget Strike-Premium Knapsack (Delta and Vega Caps)
未尝试困难免费版Python / C++ / Rust
coding-weighted-edit-trade-paths可练习
计划与实际交易路径的加权编辑距离Weighted-Cost Edit Distance Between Trade-Action Paths