title: Maximum Subarray Sum Array Created Repeated Concatenation
signature: pub fn maximum_subarray_sum_array_created_repeated_concatenation(a: Vec<i32>, n: i32, k: i32) -> i64 {
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: i64, expected: i64)->bool{
  return actual==expected
  }
  pub fn driver(a: Vec<i32>, n: i32, k: i32, expected: i64)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(a, n, k), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([5, 6, 12, 20, 23, 28, 33, 37, 47, 51, 53, 56, 63, 65, 65, 68, 69, 76, 76, 78, 83]), 18, 20, 
        15540
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([68, 10, 52, -44, 34, -4, -34, 2, 50, -60, 50, 94, -98, -98, -44, -36, -4, -62, -2, -92, -70, -48, -78, -10, 94]), 22, 22, 
        218
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([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]), 34, 29, 
        522
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([71, 59, 21, 82, 73, 29, 30, 25, 21, 10, 85, 22, 60, 43, 49, 20, 34, 39, 69, 6, 44, 27, 50, 33, 57, 29, 65, 18, 68, 56, 50, 28]), 23, 30, 
        29070
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-84, -74, -74, -56, -54, -48, -48, -46, -42, -34, -32, -30, -18, -16, -16, 6, 12, 20, 24, 26, 30, 32, 34, 42, 42, 42, 44, 46, 46, 50, 50, 62, 72, 78, 90]), 17, 23, 
        18
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0]), 16, 25, 
        300
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([3, 7, 11, 11, 26, 60, 68, 71, 77, 91, 95]), 8, 10, 
        2570
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([28, 48, -86, -52, 6, 4, 30, 18, -32, 60, -2, 16, -88, -36]), 8, 11, 
        134
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([1]), 0, 0, 
        -2147483648
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([76]), 0, 0, 
        -2147483648
      ));
      
  }
source_py: def maximum_subarray_sum_array_created_repeated_concatenation(a, n, k):
      max_so_far = (- 2147483648)
      max_ending_here = 0
      for i in range((n * k)):
          max_ending_here = (max_ending_here + a[(i % n)])
          if (max_so_far < max_ending_here):
              max_so_far = max_ending_here
          if (max_ending_here < 0):
              max_ending_here = 0
      return max_so_far
source_cpp: int maximum_subarray_sum_array_created_repeated_concatenation(vector<int> a, int n, int k) {
    int max_so_far = INT_MIN, max_ending_here = 0;
    for ( int i = 0;
    i < n * k;
    i ++ ) {
      max_ending_here = max_ending_here + a [ i % n ];
      if ( max_so_far < max_ending_here ) max_so_far = max_ending_here;
      if ( max_ending_here < 0 ) max_ending_here = 0;
    }
    return max_so_far;
  }