最长上升子序列
July_ing
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
BestCoder Round #84 1002 Bellovin
Problem Description Peter has a sequence a1,a2,...,an and he define a function on the sequence -- F(a1,a2,...,an)=(f1,f2,...,fn), where fi is the length of the longest increasing subsequence en原创 2016-07-30 11:39:26 · 355 阅读 · 0 评论 -
多校4 The All-purpose Zero 5773
The All-purpose Zero Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1503 Accepted Submission(s): 717 Problem Description ?? gets an原创 2016-08-08 09:14:14 · 350 阅读 · 0 评论
分享