Can we solve problem 1920C - Partitioning the Array faster than O(n*d(n)) ≈ O(n^(4/3))?
I'm getting interested in it.
About problem C in latest contest
Can we solve problem 1920C - Partitioning the Array faster than O(n*d(n)) ≈ O(n^(4/3))?
I'm getting interested in it.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
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 |
|
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 |
|
a_little_cute | 2024-01-14 07:52:11 | 136 | Initial revision (published) |