or is a very well-known Chef in India and even in the world. He is planning en - a n-line grid and columns m. In each cell of this grid, one flower is plan flower planted in a cell (i, j) by ai, j. v Kapoor will make a new menu with two dishes: Italian and Chinese. You any flowers as possible to decorate the dishes and make them look attrac decorated with flowers of one kind, so he can choose only one or two flov e flowers he chooses to form one connected place, so he can finish his job nnected area is a group of cells that we can move from any cell to any oth

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Answer in C++ only
Sanjiv Kapoor is a very well-known Chef in India and even in the world. He is planning to plant a
flower garden - a n-line grid and columns m. In each cell of this grid, one flower is planted; let's say
the type of flower planted in a cell (i, ) by ai, j.
Today, Sanjiv Kapoor will make a new menu with two dishes: Italian and Chinese. You need to
choose as many flowers as possible to decorate the dishes and make them look attractive. Each bowl
can only be decorated with flowers of one kind, so he can choose only one or two flowers. Also, Chef
Go wants the flowers he chooses to form one connected place, so he can finish his job as soon as
possible. Connected area is a group of cells that we can move from any cell to any other cell in this
set by simply moving between adjacent cells from the set.
Help Sanjiv Kapoor to find the largest connected area in his flower garden that contains at least two
types of flowers.
Example Input
45
11 2 3 1
3 1 25 2
5 2 1 5 6
1 3 1 2 1
Example Output
10
Transcribed Image Text:Answer in C++ only Sanjiv Kapoor is a very well-known Chef in India and even in the world. He is planning to plant a flower garden - a n-line grid and columns m. In each cell of this grid, one flower is planted; let's say the type of flower planted in a cell (i, ) by ai, j. Today, Sanjiv Kapoor will make a new menu with two dishes: Italian and Chinese. You need to choose as many flowers as possible to decorate the dishes and make them look attractive. Each bowl can only be decorated with flowers of one kind, so he can choose only one or two flowers. Also, Chef Go wants the flowers he chooses to form one connected place, so he can finish his job as soon as possible. Connected area is a group of cells that we can move from any cell to any other cell in this set by simply moving between adjacent cells from the set. Help Sanjiv Kapoor to find the largest connected area in his flower garden that contains at least two types of flowers. Example Input 45 11 2 3 1 3 1 25 2 5 2 1 5 6 1 3 1 2 1 Example Output 10
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY