Обсуждение @ 1203. Научная конференция @ Timus Online Judge

It's greedy~

Послано ZLqiang 6 мар 2011 10:04

Greedy can pass this problem quickly.

Re: It's greedy~

Послано DR. Zhihua Lai 23 ноя 2011 17:38

Edited by author 11.11.2012 02:32

Re: It's greedy~

Послано shafaet 30 дек 2011 01:11

of course greedy is correct. First sort the data according to finish time,than starting time.

Re: It's greedy~

Послано Md. Taufique Hussain 9 ноя 2012 20:44

Why won't greedy pass? Exactly this problem is used to teach greedy in most of all text books(all I have ever read).

How are you applying greedy approach after sorting by finish time, then starting time?

Послано Nikunj Banka 5 окт 2013 19:17

Suppose I have sorted the data by finish time and then by start time. Now what are you doing with the data? Are you binary searching over the data for each of the N events of the array? Please specify more.

Re: How are you applying greedy approach after sorting by finish time, then starting time?

Послано nic 6 ноя 2013 20:15

one linear pass

Re: How are you applying greedy approach after sorting by finish time, then starting time?

Послано naik 4 июн 2014 00:54

Useful test:
3
1 6
2 3
4 5

Answer: 2

Обсуждение задачи 1203. Научная конференция