subject

Given a square 2D list holding only 0's and 1's, determine the greatest number of 1's that can be covered by a square of smaller size. More formally, given an n x n 2D list in [row][col] order holding only 0's and 1's, and an integer k <= n, determine the greatest number of 1's that can be covered by a square of size k x k. Return a tuple with the number of 1's this optimal k x k square covers as the first element, the row of the top left corner of this optimal k x k square as the second element, and the col of the top left corner as the third element.

If several different k x k squares cover the same (maximum) number of 1's, return the row, col pair of the top left corner of the top left optimal placement, i. e., the placement for which row + col is smallest. There will not be a case where multiple optimal placements with the same row + col sum exist. If given k=0 or an empty 2D list, return 0 for the number of 1's covered, 0 for the row and 0 for the col.

ansver
Answers: 1

Other questions on the subject: Computers and Technology

image
Computers and Technology, 22.06.2019 04:50, edenlbarfield
Which are steps taken to diagnose a computer problem? a) reproducing the problem and using error codes b) reproducing the problem and troubleshooting c) using error codes and troubleshooting d) using error codes and stepping functions
Answers: 1
image
Computers and Technology, 23.06.2019 12:30, umimgoingtofail
What is the difference between the internet and the world wide web?
Answers: 1
image
Computers and Technology, 23.06.2019 13:30, gamingisfun
Me ! evelyn is a manager in a retail unit. she wants to prepare a report on the projected profit for the next year. which function can she use? a. pmt b. round c. division d. what-if analysis
Answers: 2
image
Computers and Technology, 23.06.2019 23:40, lexiecooley
4. what is the reason for including the following code snippet in the header file animal. h? #ifndef animal_h #define animal_h class animal { public: animal(); animal(double new_area_hunt); void birth(); void hunt(double new_area_hunt); void death(); double get_area_hunt() const; private: double area_hunt; }; #endif
Answers: 3
You know the right answer?
Given a square 2D list holding only 0's and 1's, determine the greatest number of 1's that can be co...

Questions in other subjects:

Konu
Advanced Placement (AP), 31.01.2020 11:43