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

MySQL Query : SELECT * FROM `codeshelper`.`v9_news` WHERE status=99 AND catid='6' ORDER BY rand() LIMIT 5
MySQL Error : Disk full (/tmp/#sql-temptable-64f5-1bdada7-3123a.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
MySQL Errno : 1021
Message : Disk full (/tmp/#sql-temptable-64f5-1bdada7-3123a.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
Need Help?