| Score | Problem ID | Title | Author | AC | Submission | 100 | 1845Problem A | (L3-11)最大连续子序列和 | 11 | 11 | 100 | 1846Problem B | (L3-11)最大连续子序列和plus | 11 | 16 | 100 | 1847Problem C | (L3-11)最长不下降子序列 | 12 | 32 | 100 | 1848Problem D | (L3-11)最长上升子序列 | 11 | 12 | 100 | 1849Problem E | (L3-11)最长公共子序列 | 12 | 23 | 100 | 1850Problem F | (L3-12)实现01背包 | 8 | 18 | 100 | 1851Problem G | (L3-12)01背包空间优化 | 8 | 11 | 100 | 1852Problem H | (L3-12)实现多重背包 | 7 | 27 | 100 | 1853Problem I | (L3-12)多重背包空间优化 | 6 | 10 | 100 | 1854Problem J | (L3-12)实现完全背包 | 8 | 11 | 100 | 1855Problem K | (L3-12)完全背包空间优化 | 7 | 7 | 100 | 1856Problem L | 最长上升子序列plus | 12 | 24 |
|---|