title: Longest Common Increasing Subsequence Lcs Lis
signature: func longestCommonIncreasingSubsequenceLcsLis(arr1 []int, n int, arr2 []int, m int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(arr1 []int, n int, arr2 []int, m int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(arr1, n, arr2, m),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{1, 7, 9, 35, 43, 51, 51, 66, 88}, 
  	5, 
  	[]int{10, 21, 38, 50, 65, 67, 87, 93, 99}, 
  	8, 0)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{-52, 52, -92, -46, -94, 30, -36, 18, -98, 22, -36, 96, -88, -50, 50}, 
  	7, 
  	[]int{-58, 40, 56, -62, -92, -94, 40, 18, -2, -76, -78, -14, 44, 84, 4}, 
  	10, 1)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	36, 
  	[]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	22, 2)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{5, 74, 29}, 
  	1, 
  	[]int{57, 33, 48}, 
  	1, 0)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-84, -74, -70, -62, -56, -56, -52, -2, 6, 24, 28, 44, 44, 52}, 
  	8, 
  	[]int{-98, -96, -88, -66, -32, -26, -24, -20, -4, 20, 48, 74, 90, 96}, 
  	12, 0)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0}, 
  	17, 
  	[]int{1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0}, 
  	15, 2)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{3, 4, 4, 7, 15, 15, 16, 22, 32, 32, 37, 39, 39, 41, 43, 46, 47, 47, 49, 75, 79, 80, 86, 88, 93}, 
  	19, 
  	[]int{9, 12, 15, 20, 22, 27, 28, 28, 30, 31, 35, 39, 47, 58, 58, 60, 73, 74, 76, 78, 80, 86, 95, 96, 98}, 
  	14, 4)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{70, -64, 0, 52, 32, -98, 38, -8, 34, 70, 98, 58, -48, -60, -28, -22, -72, 82, -98, -36}, 
  	16, 
  	[]int{-18, 88, -40, -52, 30, -10, -18, -56, 84, -22, -64, 80, -14, -64, 40, 92, 48, -8, 24, 82}, 
  	12, 1)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 1, 1, 1, 1, 1, 1}, 
  	7, 
  	[]int{0, 1, 1, 1, 1, 1, 1, 1}, 
  	7, 2)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{46, 87, 98}, 
  	2, 
  	[]int{67, 31, 54}, 
  	2, 0)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def longest_common_increasing_subsequence_lcs_lis(arr1, n, arr2, m):
      table = ([0] * m)
      for j in range(m):
          table[j] = 0
      for i in range(n):
          current = 0
          for j in range(m):
              if (arr1[i] == arr2[j]):
                  if ((current + 1) > table[j]):
                      table[j] = (current + 1)
              if (arr1[i] > arr2[j]):
                  if (table[j] > current):
                      current = table[j]
      result = 0
      for i in range(m):
          if (table[i] > result):
              result = table[i]
      return result
source_cpp: int longest_common_increasing_subsequence_lcs_lis(vector<int> arr1, int n, vector<int> arr2, int m) {
    int table [ m ];
    for ( int j = 0;
    j < m;
    j ++ ) table [ j ] = 0;
    for ( int i = 0;
    i < n;
    i ++ ) {
      int current = 0;
      for ( int j = 0;
      j < m;
      j ++ ) {
        if ( arr1 [ i ] == arr2 [ j ] ) if ( current + 1 > table [ j ] ) table [ j ] = current + 1;
        if ( arr1 [ i ] > arr2 [ j ] ) if ( table [ j ] > current ) current = table [ j ];
      }
    }
    int result = 0;
    for ( int i = 0;
    i < m;
    i ++ ) if ( table [ i ] > result ) result = table [ i ];
    return result;
  }