You will be given a square matrix of N rows and N columns (1 == N<= 1000) containing positive and negative integers with absolute valu
not larger than 1000. You are required to compute the greatest sum achievable by walking a path, starting at any cell of the matrix and
always moving downwards or rightwards. Additionally, you have to report the number of times that value is achievable. N will be in the fir
line of the input. N lines follow with N integers each. You should output a single line with two integers separated by a single blank space:
first one is the greatest sum, second one is the number of times this value can be reached.
Answers
Answered by
0
Answer:
I dont know please
Explanation:
Similar questions