Rose Lover
CodeChefOpen on judge ↗
Your friend is very fond of flowers. She want to get maximum number of flowers in the path from hostel to college.The path is in the form of grid of $N$ X $N$, where each cell of grid consist of $A[i][j] $ number of flowers. She will start from any cell in lowest row and will move upwards towards first row collecting the flowers at the visited cell $A[i][j] $. From $A[i][j] $ , She can choose n
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start