- 博客(1)
- 资源 (2)
- 收藏
- 关注
原创 The Heaviest Non-decreasing Subsequence Problem(LIS+思维)
题目链接: Let SS be a sequence of integers s_{1}s1, s_{2}s2, ......, s_{n}sn Each integer is is associated with a weight by the following rules: (1) If is is negative, then its weight is
2017-09-28 21:35:19 266
数据结构课设-表达式求职-带界面
数据结构课设,表达式求值+ - */ sin cos tan lg ln Pi Exp,附加日期间隔计算功能,带界面,带流程图,带图形库,带exe
2018-01-10
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人