Hi, I have a problem that affect me in many contests, I am not good at all at writing greedy solutions. Can you give advice on how to solve greedy and think greedily. Thanks in advance.
Below is a description of an IOI-style Problem: You got an array and you need to partition it into k contiguous partitions and print the maximal sum of the minimum partition and the minimum difference between the maximal and minimal partition. Can you provide me with some hints or solutions. Thanks for your time.