LeetCode - Increasing Triplet Subsequence

class Solution {
public:
    bool increasingTriplet(vector<int>& nums) {
        vector<int> dp;
        for(int t: nums){
            int l=0,r=dp.size();
            while(l<r){
                int mid = l+(r-l)/2;
                if(t>dp[mid]) l=mid+1;
                else r=mid;
            }
            if(r==dp.size()) dp.push_back(t);
            else dp[r]=t;
            if(dp.size()==3) return true;
        }
        return false;
    }
};