Обсуждение @ 1019. Перекрашивание прямой @ Timus Online Judge

Complexity:O(N*LOG(N)),TIME:0,031 sec WHO IS BETTER???

Послано Simonenko Vladislav 5 июн 2004 15:03

Complexity:O(N*LOG(N)),TIME:0,031 sec WHO IS BETTER???

Re: Complexity:O(N*LOG(N)),TIME:0,031 sec WHO IS BETTER???

Послано Тёма и Серёжа 7 июн 2004 20:02

Complexity:O(0),TIME:0 sec

Re: Complexity:O(N*LOG(N)),TIME:0,031 sec WHO IS BETTER???

Послано KRSU 2 28 фев 2005 13:16

Can you tell me the idea how to solve the problem
in O(n*log(n)) ?

0.015

770478 15:56:13
28 фев 2005 TECTOBOP 1019 Pascal Accepted
0.015 339 КБ

And it is O(N*N) ;)

Using fillchar can make it very fast.

Послано BYF 5 мар 2005 07:32

I don't think so. It's just O(N).

Послано Ves 6 мар 2005 05:24

How does it work?

Послано BYF 6 мар 2005 08:21

What works? Prog itself is O(N*N), but block, which can be replaced with FillChar, is just O(N).

Послано Ves 8 мар 2005 04:20

Time: 0.015 sec

Послано Fu Dong 8 апр 2005 15:58

816394 15:41:20
8 апр 2005 Fu Dong 1019 Pascal Accepted
0.015 660 K

My complexity is O(N^2), but I used Hash Table ,so the Time is 0.015 sec.

Re: Time: 0.015 sec

Послано KingPin 17 май 2005 00:22

849412 00:19:10

17.05.2005 KingPin 1019 Pascal Accepted

0.015 173 КБ

I used Cartesian tree. So, complexity is O(n*log(n))

Обсуждение задачи 1019. Перекрашивание прямой