请登录
| 题号 | 状态 | 题目名称 | 标签 | 通过率 | |
|---|---|---|---|---|---|
| L10600 | BZOJ4350 括号序列再战猪猪侠 | 动态规划 DP 区间 DP |
|
||
| L10601 | [NWERC 2006] Ticket to Ride | 状压 DP |
|
||
| L10602 | [CEOI 2009] Harbingers | 动态规划 DP 单调栈 二分 斜率优化 |
|
||
| L10603 | BZOJ4372 烁烁的游戏 | 线段树 树链剖分 动态树分治 |
|
||
| L10604 | BZOJ4317 Atm 的树 | 平衡树 动态树分治 |
|
||
| L10605 | 下头论文 | 模拟 |
|
||
| L10606 | 物理实验 (easy) | 贪心 |
|
||
| L10607 | 物理实验 (hard) | 贪心 |
|
||
| L10608 | 双人游戏 | 博弈论 |
|
||
| L10609 | 排除干扰 | 博弈论 贪心 |
|
||
| L10610 | 异界之门 | 二分图 |
|
||
| L10611 | 故事结局 |
|
|||
| L10612 | [BalticOI 2001] Box of Mirrors |
|
|||
| L10613 | [PA 2008] Cliquers | 动态规划 DP 背包 DP 根号分治 |
|
||
| L10614 | BZOJ3864 Hero meet devil |
|
|||
| L10615 | [ICPC 2013 WF] Self-Assembly |
|
|||
| L10616 | [ICPC 2013 WF] Hey, Better Bettor |
|
|||
| L10617 | [ICPC 2013 WF] Surely You Congest |
|
|||
| L10618 | [ICPC 2013 WF] Factors |
|
|||
| L10619 | [ICPC 2013 WF] Harvard |
|