About problem C in latest contest

Revision en3, by a_little_cute, 2024-01-14 07:53:04

Can we solve problem 1920C - Partitioning the Array faster than O(n*d(n)) ≈ O(n^(4/3))?

I'm getting interested in it.

Tags math, problem, algorithms

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English a_little_cute 2024-01-14 07:53:04 4 Tiny change: 'C] faster in O(n*d(n)' -> 'C] faster than O(n*d(n)'
en2 English a_little_cute 2024-01-14 07:52:29 2 Tiny change: 'O(n*d(n)) ~ O(n^(4/3)' -> 'O(n*d(n)) ≈ O(n^(4/3)'
en1 English a_little_cute 2024-01-14 07:52:11 136 Initial revision (published)