Given a Trip table, find each driver's consecutive 8-hour period with the highest total trip earnings.
A window starts at any trip's start_time and includes that driver's trips starting within the following 8 hours.
Rank drivers by their maximum 8-hour earnings and calculate a 10% bonus.
这道题的核心是按司机维度对行程按开始时间排序，并用滑动窗口或双指针维护“从某个 trip 的 start_time 开始、向后 8 小时内”的收入总和，找出每位司机的最大 8 小时累计 earnings。实现时通常需要先按 driver 分组，再在每组内遍历时间窗口，动态更新窗口内的 trip 记录与总收入，最后根据每位司机的峰值收入进行排序，并计算对应的 10% bonus。题目重点在于时间窗口的边界处理、分组聚合以及高效地更新窗口总和。
正文完
