SNOI Feast

Правка en1, от Sammmmmmm, 2023-07-24 13:07:09

Hi I've been looking at solutions for https://oj.uz/problem/view/NOI19_feast and I saw some kind of binary search but I don't really understand the idea behind it. Can someone help? Thanks

Given an array of n integers, split it into at most k subarray that are pair-wise disjoint.

N, K <= 3e5

|Ai| <= 1e9

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Sammmmmmm 2023-07-24 13:07:39 48
en1 Английский Sammmmmmm 2023-07-24 13:07:09 323 Initial revision (published)