随笔分类 - 最长上升子序列
摘要:摘要: 求解最长子序列问题(Longest Increasing Subsequence 缩写为 LIS )有三种方法,分别是O(n^2)的DP, O(nlogn)的二分+贪心法, 以及O(nlogn)的树状数组优化的DP,这里暂时先介绍前两种方法 一、DP(O(n^2)) 我们都知道,动态规划的一
阅读全文
摘要:Bridging signals Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4452 Accepted Submission(s): 276
阅读全文
摘要:最少拦截系统 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 68249 Accepted Submission(s): 26499 Proble
阅读全文
摘要:FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23350 Accepted Submission(s): 10
阅读全文
摘要:Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 56910 Accepted S
阅读全文