Sarah04's blog

By Sarah04, history, 5 weeks ago, In English,

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.

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Link please?