title: Longest Common Increasing Subsequence Lcs Lis
signature: pub fn longest_common_increasing_subsequence_lcs_lis(arr1: Vec<i32>, n: i32, arr2: Vec<i32>, m: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(arr1: Vec<i32>, n: i32, arr2: Vec<i32>, m: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(arr1, n, arr2, m), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([1, 7, 9, 35, 43, 51, 51, 66, 88]), 5, Vec::from([10, 21, 38, 50, 65, 67, 87, 93, 99]), 8, 
        0
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([-52, 52, -92, -46, -94, 30, -36, 18, -98, 22, -36, 96, -88, -50, 50]), 7, Vec::from([-58, 40, 56, -62, -92, -94, 40, 18, -2, -76, -78, -14, 44, 84, 4]), 10, 
        1
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([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, Vec::from([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
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([5, 74, 29]), 1, Vec::from([57, 33, 48]), 1, 
        0
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-84, -74, -70, -62, -56, -56, -52, -2, 6, 24, 28, 44, 44, 52]), 8, Vec::from([-98, -96, -88, -66, -32, -26, -24, -20, -4, 20, 48, 74, 90, 96]), 12, 
        0
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([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, Vec::from([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
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([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, Vec::from([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
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([70, -64, 0, 52, 32, -98, 38, -8, 34, 70, 98, 58, -48, -60, -28, -22, -72, 82, -98, -36]), 16, Vec::from([-18, 88, -40, -52, 30, -10, -18, -56, 84, -22, -64, 80, -14, -64, 40, 92, 48, -8, 24, 82]), 12, 
        1
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([0, 0, 1, 1, 1, 1, 1, 1]), 7, Vec::from([0, 1, 1, 1, 1, 1, 1, 1]), 7, 
        2
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([46, 87, 98]), 2, Vec::from([67, 31, 54]), 2, 
        0
      ));
      
  }
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;
  }