Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
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
Updated on: 10-Jul-2020
64 Views
Advertisements