Обсуждение @ 1403. Курьер @ Timus Online Judge

Online Judge

Задачи

Авторы

Соревнования

Обсуждение задачи 1403. Курьер

O(n^2) is the best way or not?

Послано hoan 26 дек 2010 20:01

Re: O(n^2) is the best way or not?

Послано RR 4 янв 2011 19:34

No. I solved in in O(nlogn)

Re: O(n^2) is the best way or not?

Послано hoan 5 янв 2011 18:10

Can you explain me your algo?
thanks in advance.

Re: O(n^2) is the best way or not?

Послано phizaz 14 апр 2013 22:54

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

Re: O(n^2) is the best way or not?

Послано Andrew Sboev [USU] 14 апр 2013 23:04

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

Edited by author 14.04.2013 23:05