Longest Increasing Subsequence

Given a sequence A of size N, find the length of the longest increasing subsequence from a given sequence . The longest increasing subsequence means to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible.This subsequence is not necessarily contiguous, or unique.

Note: Duplicate numbers are not counted as increasing subsequence.

Input:
The first line contains an integer T, depicting total number of test cases. Then following T lines contains an integer N depicting the size of array and next line followed by the value of array.

Output:
For each testcase, in a new line, print the Max length of the subsequence in a separate line.

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 1000
0 ≤ A[i] ≤ 300

Example:
Input:
2
16
0 8 4 12 2 10 6 14 1 9 5 13 3 11 7 15
6
5 8 3 7 9 1

Output:
6
3

Explanation:
Testcase 2: Longest increasing subsequence is of size 3 with elements (there are many subsequence, but listing one of them): 5 7 9.

The link of this problem is https://practice.geeksforgeeks.org/problems/longest-increasing-subsequence/0
 

Solution(CPP):

#include<iostream>

using namespace std;

int main()

{

    int t;

    cin>>t;

    while(t--)

    {

        int n;

        cin>>n;

        int a[n];

        for(int i=0;i<n;i++)

        {

            cin>>a[i];

        }

        int lis[n];

        for(int i=0;i<n;i++)

        {

            lis[i]=1;

        }

        for(int i=1;i<n;i++)

        {

            for(int j=0;j<i;j++)

            {

                if(a[i]>a[j] && lis[i]<lis[j]+1)

                {

                    lis[i]=lis[j]+1;

                }

            }

        }

        int max=lis[0];

        for(int i=1;i<n;i++)

        {

            if(max<lis[i])

            {

                max=lis[i];

            }

        }

        cout<<max<<endl;

    }

//code

return 0;

}