Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Input: Example 3 Input: grid Example 4 Input: grid 113 Output: 8 Explanation: Maximum non-negative product (in red) is 1.1.-2.-4.1 = 8. 224 grid -4 HIL 3 Output: 0 Explanation: Maximum non-negative product (in red) is 1.0-4 = 0. 1 4 4 -2 0 0 1 1 -1 1 1 Output: 2 Explanation: Maximum non-negative product (in red) is 1-2-1-1-1-1= 2.

Input: Example 3 Input: grid Example 4 Input: grid 113 Output: 8 Explanation: Maximum non-negative product (in red) is 1.1.-2.-4.1 = 8. 224 grid -4 HIL 3 Output: 0 Explanation: Maximum non-negative product (in red) is 1.0-4 = 0. 1 4 4 -2 0 0 1 1 -1 1 1 Output: 2 Explanation: Maximum non-negative product (in red) is 1-2-1-1-1-1= 2.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

 

 

Example 2 Input: Example 3 Input: grid Output: 8 Explanation: Maximum non-negative product (in red) is 1.1.-2.-4.1-8. Example 4 Input: 13, 1 8714-[2] grid Output: 0 Explanation: Maximum non-negative product (in red) is 1.0-4 = 0. grid = 0 0 1 -1 1 1 Output: 2 Explanation: Maximum non-negative product (in red) is 1-2.1-1.1.1-2. You must solve this using both a bottom-up Dynamic Programming algorithm and a memoized recursive algorithm. (a) Pseudocode • Define the subproblems for your DP solution for finding the maximum non-negative product value. • Give a recursive formulation, including the base cases, to solve this problem. • What is the running time of your solution? • Write a DP algorithm (give pseudocode) that outputs the maximum non-negative product value. • Write a memoized algorithm (give pseudocode) that outputs the maximum non-negative product value. (b) Source Code • Write your solution in Python, C, C++, Java, or JavaScript.
Transcribed Image Text:Example 2 Input: Example 3 Input: grid Output: 8 Explanation: Maximum non-negative product (in red) is 1.1.-2.-4.1-8. Example 4 Input: 13, 1 8714-[2] grid Output: 0 Explanation: Maximum non-negative product (in red) is 1.0-4 = 0. grid = 0 0 1 -1 1 1 Output: 2 Explanation: Maximum non-negative product (in red) is 1-2.1-1.1.1-2. You must solve this using both a bottom-up Dynamic Programming algorithm and a memoized recursive algorithm. (a) Pseudocode • Define the subproblems for your DP solution for finding the maximum non-negative product value. • Give a recursive formulation, including the base cases, to solve this problem. • What is the running time of your solution? • Write a DP algorithm (give pseudocode) that outputs the maximum non-negative product value. • Write a memoized algorithm (give pseudocode) that outputs the maximum non-negative product value. (b) Source Code • Write your solution in Python, C, C++, Java, or JavaScript.
Problem 1 Maximum Non-Negative Product in a Matrix You are given a rows x cols matrix grid. Initially, you are located at the top-left corner (0,0) and, in each step, you can only move right or down in the matrix. Among all possible paths starting from the top-left corner (0,0) and ending in the bottom-right corner (rows - 1, cols-1), find the path with the maximum non-negative product. The product of a path is the product of all integers in the grid cells visited along the path. Return the maximum non-negative product mod 109 +7. If the maximum product is negative, return -1. Note that the modulo is performed after getting the maximum product. Example 1 Input: grid -2 -3 3 -3 -2 Output: -1 Explanation: It's not possible to get non-negative product in the path from (0, 0) to (2, 2), so return -1.
Transcribed Image Text:Problem 1 Maximum Non-Negative Product in a Matrix You are given a rows x cols matrix grid. Initially, you are located at the top-left corner (0,0) and, in each step, you can only move right or down in the matrix. Among all possible paths starting from the top-left corner (0,0) and ending in the bottom-right corner (rows - 1, cols-1), find the path with the maximum non-negative product. The product of a path is the product of all integers in the grid cells visited along the path. Return the maximum non-negative product mod 109 +7. If the maximum product is negative, return -1. Note that the modulo is performed after getting the maximum product. Example 1 Input: grid -2 -3 3 -3 -2 Output: -1 Explanation: It's not possible to get non-negative product in the path from (0, 0) to (2, 2), so return -1.
Expert Solution
steps

Step by step

Solved in 3 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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
SEE MORE TEXTBOOKS