Binary search is wrong
\n Describe your first thoughts on how to solve this problem. \nBinary search only works when the answer is monotonic, which means if you can split it into x pa
\n<!-- Describe your first thoughts on how to solve this problem. -->\nBinary search only works when the answer is monotonic, which means if you can split it into x parts, it must can be split into x+1 parts. but it is not true, consider a case where you can split a long message into 999 parts, but you may not split it into 1000 parts, because 1000 is one character more than 999, will take 999 more characters in first 999 parts, but the new 1000th part holds less than 999 characters (when limit is less than 999).
['C++']