- 博客(54)
- 收藏
- 关注
原创 动态规划P1
只能向下或向右走,求最大能取多少花生记录每个点最大能取到多少花生,从左上一直推到右下角dpijmaxdpi−1jdpij−1])aijOtn2同上,只是取最小值dpijmindpi−1jdpij−1])aij。
2023-07-07 19:36:10
217
原创 Educational Codeforces Round 150 (Rated for Div. 2) A~D
Educational Codeforces Round 150 (Rated for Div. 2) A~D
2023-06-24 14:50:19
406
原创 Codeforces Round 878 (Div. 3) F. Railguns
Codeforces Round 878 (Div. 3) F. Railguns
2023-06-24 13:13:34
587
原创 Codeforces Round 878 (Div. 3) A~E G1
Codeforces Round 878 (Div. 3) A~E G1
2023-06-22 21:27:14
858
原创 Educational Codeforces Round 143 (Rated for Div. 2) A~E
Educational Codeforces Round 143 (Rated for Div. 2) A~E
2023-05-02 21:45:09
83
原创 Codeforces Round 867 (Div. 3) G2. Magic Triples (Hard Version)
G2 - Magic Triples (Hard Version)
2023-04-27 20:18:30
68
原创 Codeforces Round 856 (Div. 2) D. Counting Factorizati
D. Counting Factorizations
2023-04-13 19:47:21
88
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人