longest increasing subsequence by dynamic programming

#include<iostream>
#include<math.h>
using namespace std;

int LIS(int arr[],int n){
  if(n==0|| n==1)
    return n;
  int L[n]={0};
  L[0]=1;
  for(int i=1;i<n;i++){
    for(int j=0;j<i;j++){
      if(arr[j]<arr[i]){
        L[i]=max(1+L[j],L[i]);
        }
      }
      if(L[i]==0)
        L[i]=1;
    }
    int max_len=0;
    for(int i=0;i<n;i++)
        max_len=max(L[i],max_len);
    return max_len;
  }

int main(){
  int n=8;
  int arr[] = { 10, 22, 9, 33, 21, 50, 41, 60 };
  cout<<LIS(arr,n);
  return 0;
  }