Event Scheduler with Setup Time

You are given a list of events. Each event is represented as a tuple of three integers: (start_time, end_time, setup_time). The values start_time and end_time denote the time window during which the event takes place, and setup_time represents the minimum gap required immediately before the event can start. An event can be scheduled after another event only if its start_time is greater than or equal to the previous event's end_time plus its own setup_time.

Your task is to write a function that determines the maximum number of events that can be scheduled in a single room without conflicts. You may rearrange the events in any order and it is not necessary to schedule all events.

For example, given the list of events:

[(1, 4, 0), (5, 7, 1), (3, 5, 1), (8, 9, 0)]

One possible valid schedule is to select events such that the condition is met between consecutive events. (This is just an example to illustrate the format; your solution should work for any valid list of events.)

Write your solution in any programming language of your choice and ensure that it is optimized for efficiency, considering that the input list may be large.