Обсуждение @ 1330. Интервалы @ Timus Online Judge

Online Judge

Задачи

Авторы

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

Обсуждение задачи 1330. Интервалы

Georgi_georgiev AC [2] // Задача 1330. Интервалы 5 ноя 2007 17:48

AC this problem is very simple!
Try to solve the problem with O(n).

pnt Re: AC [1] // Задача 1330. Интервалы 29 июл 2009 16:59

Try to solve it in O(log n) //disregarding the input, of course ;)

kobra Re: AC // Задача 1330. Интервалы 10 авг 2010 17:42

the fastest algorithm is O(N+Q). Faster is impossible!
Building RMQ doesn't have a sense, because you don't using the operation update.