xxxxxxxxxx
class Solution
{
//Function to find length of longest increasing subsequence.
static int longestSubsequence(int size, int arr[])
{
// code here
int n=size;
int maxLen=0;
int dp[]=new int[n];
Arrays.fill(dp,1);
for(int i=0; i<n; i++){
for(int prev=0; prev<i; prev++){
if(arr[i]>arr[prev] && 1+dp[prev]>dp[i]){
dp[i]=1+dp[prev];
}
}
maxLen=Math.max(dp[i],maxLen);
}
return maxLen;
}
}