LIS
文章平均质量分 83
vocaloid01
小菜鸟一只_(:з」∠)_前来膜拜各路大佬orz
展开
-
HDU - 3998 Sequence
There is a sequence X (i.e. x[1], x[2], ..., x[n]). We define increasing subsequence of X as x[i1], x[i2],...,x[ik], which satisfies follow conditions: 1) x[i1] < x[i2],...,<x[ik]; 2) 1<=i1 &...原创 2018-05-07 20:03:50 · 226 阅读 · 0 评论 -
O(nlogn) 求LIS(Longest Increasing Subsequence)方法的总结
前几天做题遇到求LIS的题,照常用dp去做结果超时了。之后就去网上找了O(nlogn)的方法。因为看了好几个博客我才看懂,所以这里我进行下总结。首先第一种写法:假设存在一个序列d[1..9] = 2 1 5 3 6 4 8 9 7,可以看出来它的LIS长度为5。下面一步一步试着找出它。我们定义一个序列B,然后令 i = 1 to 9 逐个考察这个序列。此外,我们用一个变量Len来记录现在最长算到多...原创 2018-05-07 20:25:59 · 372 阅读 · 0 评论 -
Gym - 101889F Fundraising(树状数组求带权最长上升子序列)
ICPC Latin American Regional – 2017 Problem F – Fundraising Author: Paulo Cezar Pereira Costa, Brasil A prestigious politician aiming for presidency next year is planning a fundraising dinner for h...原创 2018-10-06 20:53:15 · 924 阅读 · 0 评论