- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
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
#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
- Related Articles
- Maximum subarray sum in an array created after repeated concatenation in C++ Program
- 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++
- K-Concatenation Maximum Sum in C++
- Maximum Sum Circular Subarray in C++
- Maximum circular subarray sum in C++
- Maximum sum bitonic subarray in C++
- Maximum subarray sum in circular array using JavaScript
- 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
- Maximum subarray sum modulo m in C++
- Maximum subarray sum in array formed by repeating the given array k times in C++
- Find Maximum Sum Strictly Increasing Subarray in C++
- Maximum Subarray Sum with One Deletion in C++
- Maximum Subarray Sum Excluding Certain Elements in C++

Advertisements