Ou will be given a square matrix of n rows and n columns (1 <= n <= 1000) containing positive and negative integers with absolute value 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 first 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
2
Answer:
Explansjsksotijwbsjakdlkamdndbdxvation:
Similar questions