Comments
+5

I have O(n.log(1e9)) solution for 875E - Delivery Club

check my solution here : 31480382
On M_H_M → A Good Problem, 11 years ago
+6

Now who was right? And who said a bluff?
You are wrong and it is solvable in O(n).
You can't say such a thing does not exist just because you don't know anything about it!