Impressive.
Once you have the minimum height, calculating the actual partition is equivalent to the text justification problem, with each category being a word, its length being the word's length, and the minimum height being the line length. This has been done before.
--
The hell with paco, vote for Erudil!
:wq
In reply to Re(2): Puzzle: need a more general algorithm
by FoxtrotUniform
in thread Puzzle: need a more general algorithm
by Ovid
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |