LeetCode Longest Increasing Subsequence （LIS O(nlogn)）

class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
if(nums.empty())    return 0;
int *p=new int[nums.size()];
p[0]=nums[0];
int len=0;
for(int i=1; i<nums.size(); i++)
{
if(nums[i]>p[len])
p[++len]=nums[i];
else
*lower_bound(p,p+len+1,nums[i])=nums[i];
}
delete []p;
return ++len;
}
};