请登录
| 题号 | 状态 | 题目名称 | 标签 | 通过率 | |
|---|---|---|---|---|---|
| L8895 | 「DPOI-1」优美的序列 | 数学 平衡树 |
|
||
| L8896 | 「DPOI-1」道路规划 | 贪心 优先队列 构造 |
|
||
| L8897 | [USACO22DEC] Cow College B | 贪心 排序 |
|
||
| L8898 | [USACO22DEC] Feeding the Cows B | 贪心 |
|
||
| L8899 | [USACO22DEC] Reverse Engineering B | 模拟 贪心 |
|
||
| L8900 | [USACO22DEC] Barn Tree S | 贪心 构造 |
|
||
| L8901 | [USACO22DEC] Circular Barn S | 博弈论 |
|
||
| L8902 | [USACO22DEC] Range Reconstruction S | 构造 |
|
||
| L8903 | [USACO22DEC] Bribing Friends G | 动态规划 DP 背包 DP |
|
||
| L8904 | [USACO22DEC] Mountains G | 数学 线段树 模拟 |
|
||
| L8905 | [USACO22DEC] Strongest Friendship Group G | 连通块 并查集 枚举 |
|
||
| L8906 | [USACO22DEC] Breakdown P | 折半搜索 meet in the middle 最短路 均摊分析 |
|
||
| L8907 | [USACO22DEC] Making Friends P | 启发式合并 |
|
||
| L8908 | [USACO22DEC] Palindromes P | 数学 树状数组 均摊分析 |
|
||
| L8909 | [RC-06] Multiples |
|
|||
| L8910 | [RC-06] Operation Sequence |
|
|||
| L8911 | [RC-06] Minimum and Maximum |
|
|||
| L8912 | [RC-06] ijk |
|
|||
| L8913 | [RC-06] Remake |
|
|||
| L8914 | [DMOI-R2] 梦境 | 图论 最短路 |
|