dp easy solution (memorization concept ) c++ solution 
IntuitionApproachComplexityo(n);
Time complexity:

Space complexity:
o(n)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
o(n);
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
- o(n)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int n = nums.size();
        vector<int> dp (  n , 1);
        if (n==1) return 1;
        int maxi=0;
        for (int i=1;i< n;i++){
            if (nums[i]>nums[i-1]){
                dp[i]=dp[i-1]+1;
            }
            maxi=max(maxi,dp[i]);
            

        }
        return maxi;

        
    }
};
```
['C++']