Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

a_little_cute's blog

By a_little_cute, history, 3 years ago, In English

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

I'm getting interested in it.

Full text and comments »

  • Vote: I like it
  • +16
  • Vote: I do not like it