Must add output screenshot, editable code Write a java program for the following question. Consider a non-empty array inarr of positive integers containing at least two elements and an integer innum where 0
Must add output screenshot, editable code
Write a java program for the following question.
Consider a non-empty array inarr of positive integers containing at least two elements and an integer innum where 0<innum. Identify and print an integer outnum as per the logic below:
Identify the various combinations in which the elements of inarr
can be divided into maximum of innum groups such that: o each element occurs exactly in one group and o each group will contain elements which are adjacent to
each other in inarr
• For each combination identify the group whose sum of elements is maximum.
Assign the minimum value from the above identified maximum
sums to outnum.
Input format:
First line would contain the elements of inarr separated by ','(comma)
Second line would contain the integer value innum.
Read the inputs from the standard input stream
Output format:
Print outnum to the standard output stream.
![Sample Input
Sample Output
Explanation
5,10,30,20, 15
35
For the given
3
inputs, inarr is [5,
10, 30, 20, 15] and
innum is 3. Few of
the possible
combinations(C1,C
2,C3 & C4) are:
C1:
Group 1: {5,10}
sum=15
Group 2: {30,20,15}
sum=65
the group with
maximum sum of
elements is Group
2: {30,20,15} and
the sum is 65
C2:
Group 1:{5} sum3D5](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe35eddea-eff4-4010-8ccd-311cc5286253%2F5a269ca5-bd95-4c20-8d63-7f06efd82dcf%2Fr65v1pv_processed.jpeg&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
