Question on maxiumum mex

Правка en2, от kavascg, 2024-11-01 09:14:35

Suppose we partition the elements of an array b into any number k of non-empty subarrays S1,S2,…,Sk , where k is an arbitrary positive integer. Define the score of b as the maximum value of MEX(S1)+MEX(S2)+…+MEX(Sk) over all possible partitions of b for any integer k n <= 2e5

how can i calculate score .

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский kavascg 2024-11-01 10:45:20 54 Tiny change: ' is 3** \nhow can ' -> ' is 3** \n\nhow can '
en3 Английский kavascg 2024-11-01 09:56:37 21 Tiny change: 'n <= 2e5\n\nhow can ' -> 'n <= 2e5\n(continous subarrays)\nhow can '
en2 Английский kavascg 2024-11-01 09:14:35 32 Tiny change: 'nteger k\n\nn <= 2e5\n.' -> 'nteger k\nn <= 2e5\n\nhow can i calculate score\n.'
en1 Английский kavascg 2024-11-01 09:13:59 307 Initial revision (published)