题意:现在有一个点堆, 一开始先给你m个点,然后再用题目中的rand函数生成剩下的n个点,问在这个点堆中可以找到的最长严格递增序列的长度是多少. 题解: 很常见的一个3维CDQ. 先按照z轴 sort 一遍,然后对于当前的序列去cdq分治.对于CDQ的每一层来说,都是用左边的点的值去更新右边点的值,对于每一层来说, 我们按照x轴sort, sort的时候注意,当同x的时候,一定是右边的询问点要在左边的修改点前面, 不然就不能保证前面的都是合法点, 对于每一个添加点来说,我们在其y轴对应的位置更新…

题目链接: here 题意: 和hdu4742类似.差别就是一部分三元组是直接给出的.另一部分是用他给的那个函数生成的.还有就是这里的大于是严格的大于a>b必须ax>bx,ay>by,az>bz. 思路: 思路也和hdu4742here类似. 仅仅是有几个比較棘手的问题.如今变成严格大于了.对于y还是非常好办的.我们在排序y的时候能够使的标号大的排在前面这样就能够防止y和它一样的更新它了.感觉比較麻烦的是x一样怎么办.这个真没想出什么好办法.就仅仅有x和mid+1的x不一样的建一个…

DP use HashMap: 根据string的长度sort,然后维护每个string的longest chain,default为1,如果删除某个char生成的string能提供更长的chain,则更新 package twoSigma; import java.util.Arrays; import java.util.Comparator; import java.util.HashMap; import java.lang.StringBuilder; public class Lon…

题目链接: http://acm.hust.edu.cn/vjudge/problem/356795 Racing Gems Time Limit: 3000MS 问题描述 You are playing a racing game. Your character starts at the x axis (y = 0) and proceeds up the race track, which has a boundary at the line x = 0 and another at x…

原题链接在这里:https://leetcode.com/problems/longest-string-chain/ 题目: Given a list of words, each word consists of English lowercase letters. Let's say word1 is a predecessor of word2 if and only if we can add exactly one letter anywhere in word1 to make i…

The following iterative sequence is defined for the set of positive integers: n n/2 (n is even) n 3n + 1 (n is odd) Using the rule above and starting with 13, we generate the following sequence: 13 40 20 10 5 16 8 4 2 1 It can be seen that this seque…

You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c. Chain of pairs can be formed in this fashion. Given a set of…

You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c. Chain of pairs can be formed in this fashion. Given a set of…

You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c. Chain of pairs can be formed in this fashion. Given a set of…

［抄题］: You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c. Chain of pairs can be formed in this fashion. Given a…