| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 10855 | 10855 最低通行费 | 0 / 0 | (None) | |
| 10856 | 10856 拦截导弹 | 0 / 0 | (None) | |
| 10857 | 10857 摘花生 | 0 / 0 | (None) | |
| 10858 | 10858 登山 | 0 / 0 | (None) | |
| 10859 | 10859 怪盗基德的滑翔翼 | 0 / 0 | (None) | |
| 10860 | 10860 最大上升子序列和 | 0 / 0 | (None) | |
| 10861 | 10861 数字组合 | 0 / 0 | (None) | |
| 10862 | 10862 采药 | 0 / 0 | (None) | |
| 10863 | 10863 买书 | 0 / 0 | (None) | |
| 10864 | 10864 宠物小精灵之收服 | 0 / 0 | (None) | |
| 10865 | 10865 迷宫问题 | 0 / 0 | (None) | |
| 10866 | 10866 糖果 | 0 / 0 | (None) | |
| 10867 | 10867 计算字符串距离 | 0 / 0 | (None) | |
| 10868 | 10868 走出迷宫 | 0 / 0 | (None) | |
| 10869 | 10869 Knight Moves | 0 / 0 | (None) | |
| 10870 | 10870 献给阿尔吉侬的花束 | 0 / 0 | (None) | |
| 10871 | 10871 仙岛求药 | 0 / 0 | (None) | |
| 10872 | 10872 装箱问题 | 0 / 0 | (None) | |
| 10873 | 10873 Charm Bracelet | 0 / 0 | (None) | |
| 10874 | 10874 公共子序列 | 0 / 0 | (None) | |
| 10875 | 10875 抓住那头牛 | 0 / 0 | (None) | |
| 10876 | 10876 开餐馆 | 0 / 0 | (None) | |
| 10877 | 10877 棋盘问题 | 0 / 0 | (None) | |
| 10878 | 10878 红与黑 | 0 / 0 | (None) | |
| 10879 | 10879 一元三次方程求解 | 5 / 18 | 8 | |
| 10880 | 10880 拦截导弹 | 0 / 0 | (None) | |
| 10881 | 10881 机器分配 | 0 / 0 | (None) | |
| 10882 | 10882 最长公共子序列 | 0 / 0 | (None) | |
| 10883 | 10883 完全背包问题 | 0 / 0 | (None) | |
| 10884 | 10884 01背包问题 | 0 / 0 | (None) | |
| 10885 | 10885 鸡蛋的硬度 | 0 / 0 | (None) | |
| 10886 | 10886 挖地雷 | 0 / 0 | (None) | |
| 10887 | 10887 城市交通路网 | 0 / 0 | (None) | |
| 10888 | 10888 合唱队形 | 0 / 0 | (None) | |
| 10889 | 10889 友好城市 | 0 / 0 | (None) | |
| 10890 | 10890 庆功会 | 0 / 0 | (None) | |
| 10891 | 10891 潜水员 | 0 / 0 | (None) | |
| 10892 | 10892 混合背包 | 0 / 0 | (None) | |
| 10893 | 10893 方格取数 | 0 / 0 | (None) | |
| 10894 | 10894 编辑距离 | 0 / 0 | (None) | |
| 10895 | 10895 橱窗布置 | 0 / 0 | (None) | |
| 10896 | 10896 复制书稿 | 0 / 0 | (None) | |
| 10897 | 10897 货币系统 | 0 / 0 | (None) | |
| 10898 | 10898 分组背包 | 0 / 0 | (None) | |
| 10899 | 10899 乘积最大 | 0 / 0 | (None) | |
| 10900 | 10900 合并石子 | 0 / 0 | (None) | |
| 10901 | 10901 滑雪 | 0 / 0 | (None) | |
| 10902 | 10902 最大子矩阵 | 0 / 0 | (None) | |
| 10903 | 10903 最长上升子序列 | 0 / 0 | (None) | |
| 10904 | 10904 三角形最佳路径问题 | 0 / 0 | (None) | |
| 10905 | 10905 最低通行费 | 0 / 0 | (None) | |
| 10906 | 10906 拦截导弹 | 0 / 0 | (None) | |
| 10907 | 10907 摘花生 | 0 / 0 | (None) | |
| 10908 | 10908 登山 | 0 / 0 | (None) | |
| 10909 | 10909 怪盗基德的滑翔翼 | 0 / 0 | (None) | |
| 10910 | 10910 最大上升子序列和 | 0 / 0 | (None) | |
| 10911 | 10911 数字组合 | 0 / 0 | (None) | |
| 10912 | 10912 采药 | 0 / 0 | (None) | |
| 10913 | 10913 买书 | 0 / 0 | (None) | |
| 10914 | 10914 宠物小精灵之收服 | 0 / 0 | (None) | |
| 10915 | 10915 迷宫问题 | 0 / 0 | (None) | |
| 10916 | 10916 糖果 | 0 / 0 | (None) | |
| 10917 | 10917 计算字符串距离 | 0 / 0 | (None) | |
| 10918 | 10918 走出迷宫 | 0 / 0 | (None) | |
| 10919 | 10919 Knight Moves | 0 / 0 | (None) | |
| 10920 | 10920 献给阿尔吉侬的花束 | 0 / 0 | (None) | |
| 10921 | 10921 仙岛求药 | 0 / 0 | (None) | |
| 10922 | 10922 装箱问题 | 0 / 0 | (None) | |
| 10923 | 10923 Charm Bracelet | 0 / 0 | (None) | |
| 10924 | 10924 公共子序列 | 0 / 0 | (None) | |
| 10925 | 10925 抓住那头牛 | 0 / 0 | (None) | |
| 10926 | 10926 开餐馆 | 0 / 0 | (None) | |
| 10927 | 10927 走迷宫 | 0 / 0 | (None) | |
| 10928 | 10928 求最长不下降序列 | 0 / 0 | (None) | |
| 10929 | 10929 数字金字塔 | 0 / 0 | (None) | |
| 10930 | 10930 牛的旅行 | 0 / 0 | (None) | |
| 10931 | 10931 最短路径问题 | 5 / 10 | 9 | |
| 10932 | 10932 香甜的黄油 | 0 / 0 | (None) | |
| 10933 | 10933 大盗阿福 | 0 / 0 | (None) | |
| 10934 | 10934 最小花费 | 0 / 0 | (None) | |
| 10935 | 10935 一笔画问题 | 0 / 0 | (None) | |
| 10936 | 10936 扩展二叉树 | 0 / 0 | (None) | |
| 10937 | 10937 高精度乘法 | 8 / 19 | 7 | |
| 10938 | 10938 最长公共子上升序列 | 0 / 0 | (None) | |
| 10939 | 10939 回文数 | 0 / 0 | (None) | |
| 10940 | 10940 高精除 | 0 / 0 | (None) | |
| 10941 | 10941 鸣人的影分身 | 0 / 0 | (None) | |
| 10942 | 10942 格子游戏 | 0 / 0 | (None) | |
| 10943 | 10943 亲戚 | 0 / 0 | (None) | |
| 10944 | 10944 股票买卖 | 0 / 0 | (None) | |
| 10945 | 10945 Maximum sum | 0 / 0 | (None) | |
| 10946 | 10946 最优布线问题 | 0 / 0 | (None) | |
| 10947 | 10947 数的划分 | 0 / 0 | (None) | |
| 10948 | 10948 城市公交网建设问题 | 0 / 0 | (None) | |
| 10949 | 10949 车厢重组 | 0 / 0 | (None) | |
| 10950 | 10950 昆虫繁殖 | 0 / 0 | (None) | |
| 10951 | 10951 求逆序对 | 0 / 0 | (None) | |
| 10952 | 10952 最短网络 | 0 / 0 | (None) | |
| 10953 | 10953 自然数的拆分 | 0 / 0 | (None) | |
| 10954 | 10954 组合的输出 | 0 / 0 | (None) |
By signing up a 算道OJ universal account, you can submit code and join discussions in all online judging services provided by us.