Longest Increasing Subsequence Average time O(nlogk) Solution

/* average case O(nk) solution */
int main(vector<int> a) {
  vector<int> subseq;
  int i, tmp;
  for (i = 0; i < a.size(); i++) {
    tmp = lower_bound(subseq.begin(), subseq.end(), a[i]) - subseq.begin();
    if (tmp >= subseq.size())
      subseq.push_back(a[i]);
    else
      subseq[tmp] = a[i];
  }
  return subseq.size();
}