Cut the rope, cut the rope of length n into m segments, and find the maximum value of the length product of each segment (mforce n is an integer)

cut the rope, cut the rope of length n into m segments, and find the maximum value of the length product of each segment
I would like to ask myself what is the idea of typing n and m

.
Mar.04,2021

it's like maximum self-sequence and problem


dynamic programming algorithm, learn about
Link description

Link description

Menu