Maximum subarray sum in an array created after repeated concatenation in C++

In this tutorial, we will be discussing a program to find maximum subarray sum in an array created after repeated concatenation.

For this we will be provided with an array and an integer K. Our task is to find the subarray with the maximum elements when the given array is repeated K times.

Example

 Live Demo

#include<bits/stdc++.h>
using namespace std;
//returning sum of maximum subarray
int maxSubArraySumRepeated(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;
}
int main() {
   int a[] = {10, 20, -30, -1};
   int n = sizeof(a)/sizeof(a[0]);
   int k = 3;
   cout << "Maximum contiguous sum is "
   << maxSubArraySumRepeated(a, n, k);
   return 0;
}

Output

Maximum contiguous sum is 30

Ayush Gupta

Published on 10-Jul-2020 14:07:59

• Related Questions & Answers
• Maximum subarray sum in an array created after repeated concatenation in C++ Program
• K-Concatenation Maximum Sum in C++
• Find maximum array sum after making all elements same with repeated subtraction in C++
• Maximum Subarray Sum after inverting at most two elements in C++
• Maximum Sum Circular Subarray in C++
• Maximum sum bitonic subarray in C++
• Maximum subarray sum in circular array using JavaScript
• Maximum subarray sum modulo m in C++
• Maximum circular subarray sum in C++\n
• Maximize the maximum subarray sum after removing at most one element in C++
• Maximum subarray sum after dividing array into subarrays based on the given queries in Java
• Find Maximum Sum Strictly Increasing Subarray in C++
• Maximum Subarray Sum with One Deletion in C++
• Maximum Subarray Sum Excluding Certain Elements in C++
• Maximum Size Subarray Sum Equals k in C++