Discussion @ 1403. Courier @ Timus Online Judge

hoan O(n^2) is the best way or not? [4] // Problem 1403. Courier 26 Dec 2010 20:01

No. I solved in in O(nlogn)

hoan Re: O(n^2) is the best way or not? [2] // Problem 1403. Courier 5 Jan 2011 18:10

Can you explain me your algo?
thanks in advance.

phizaz Re: O(n^2) is the best way or not? [1] // Problem 1403. Courier 14 Apr 2013 22:54

I think you have to use binary tree to implement something.

Andrew Sboev [USU] Re: O(n^2) is the best way or not? // Problem 1403. Courier 14 Apr 2013 23:04

Binary tree? Are you kidding? just quick sorting of array and little thinking.

Edited by author 14.04.2013 23:05

Discussion of Problem 1403. Courier