Write a program to find the maximum sum of 7-Item-SubArray-Pair in given 2D-Array.For example, in the following 2D-Array, the maximum sum of 7-Item-SubArray-Pair is highlighted withred selected area, which is the same like this pattern and maximum/largest sum of this selected redarea is 19.Problem Explanation:The naive solution for this problem is to check every possible 7-Item-SubArray-Pair-Pattern in the given2D-Array. Actually there are many pattern of 7-Item-SubArray-Pair in the given 2D-Array.Maximum sum of 7-Item-Pair should be from 3x3 Sub-Array of the given 2D-Array. Total 16 pair of 3x3Sub-Array is following below: 11 1 00 1 0 0 0 01110 0 0o 0 2 4 4 00 0 0[2]0 0o O I 2 4 0The Maximum 7-Item Sum of 3x3 Sub-Array-PairSample input:21)-Array structure with Values1 1 1 0 0 00 1 0 0 0 01110 0 00 0 2 4 4 00 0 0 2 0 00 0 1 2 4 0(1, 1, 1, 0, 0, 0),[0, 1, 0, 0, 0, 0),[1, 1, 1, 0, 0, 01,[0, 0, 2, 4, 4, 01,[0, 0, 0, 2, 0, 01,[0, 0, 1, 2, 4, 0]Sample input:Maximum Sum of 7-Item-Pair Pattern: 19 All 16 patterns of 7-Item-Pair are the following7-Item-Pair maximum sum is highlighted below:1 1 1 1 1 0 1 0 0 0 0 011 1 1 1 0 1 0 0 0 0 011 1 1 1 1 01 0 01 1 1 1 1 0 1 0 0 0 0 e0 1 0 1 0 00 10 1 0 0 0 0 0 0 0 010 2 4110 0 20 2 42 4 44 4 02 4 44 4 011 11 1 01 0 0 0 0 01 1 1 1 1 0 1 0 0 0 0242440 0 0 0 0 20 2 0 2 0 00 0 0 0 0 2 0 2 0 2 0 0e 0 2 0 2 4 2 4 4 4 4 020 0 1 0 1 2 1 2 4 2 4 00 0 2 0 2 42 4 4 4 4 020 0 1 0 1 2 1 2 4 2 4 0Maximum Sum of 7-Item-Pair in 2D-Array is 19

Sample Response: //C++ program to find maximum sum-subarray of a 2D…

Answered: Write a program to find the maximum sum…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Write a program to find the maximum sum of 7-Item-SubArray-Pair in given 2D-Array.
For example, in the following 2D-Array, the maximum sum of 7-Item-SubArray-Pair is highlighted with
red selected area, which is the same like this pattern and maximum/largest sum of this selected red
area is 19.

Problem Explanation:
The naive solution for this problem is to check every possible 7-Item-SubArray-Pair-Pattern in the given
2D-Array. Actually there are many pattern of 7-Item-SubArray-Pair in the given 2D-Array.
Maximum sum of 7-Item-Pair should be from 3x3 Sub-Array of the given 2D-Array. Total 16 pair of 3x3
Sub-Array is following below:

11 1 0
0 1 0 0 0 0
1110 0 0
o 0 2 4 4 0
0 0 0[2]0 0
o O I 2 4 0
The Maximum 7-Item Sum of 3x3 Sub-Array-Pair
Sample input:
21)-Array structure with Values
1 1 1 0 0 0
0 1 0 0 0 0
1110 0 0
0 0 2 4 4 0
0 0 0 2 0 0
0 0 1 2 4 0
(1, 1, 1, 0, 0, 0),
[0, 1, 0, 0, 0, 0),
[1, 1, 1, 0, 0, 01,
[0, 0, 2, 4, 4, 01,
[0, 0, 0, 2, 0, 01,
[0, 0, 1, 2, 4, 0]
Sample input:
Maximum Sum of 7-Item-Pair Pattern: 19

All 16 patterns of 7-Item-Pair are the following
7-Item-Pair maximum sum is highlighted below:
1 1 1 1 1 0 1 0 0 0 0 0
11 1 1 1 0 1 0 0 0 0 0
1
1 1 1 1 1 0
1 0 0
1 1 1 1 1 0 1 0 0 0 0 e
0 1 0 1 0 0
0 10 1 0 0 0 0 0 0 0 0
1
0 2 4
1
1
0 0 2
0 2 4
2 4 4
4 4 0
2 4 4
4 4 0
11 1
1 1 0
1 0 0 0 0 0
1 1 1 1 1 0 1 0 0 0 0
2
4
2
4
4
0 0 0 0 0 2
0 2 0 2 0 0
0 0 0 0 0 2 0 2 0 2 0 0
e 0 2 0 2 4 2 4 4 4 4 0
2
0 0 1 0 1 2 1 2 4 2 4 0
0 0 2 0 2 4
2 4 4 4 4 0
2
0 0 1 0 1 2 1 2 4 2 4 0
Maximum Sum of 7-Item-Pair in 2D-Array is 19

Expert Solution

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions