← 返回 doordash 的题目列表Maximize Dasher Profit
类型：online_judge
Given a dasher's startTime and endTime, and three arrays dStart[], dEnd[], dProfit[] representing the start time, end time, and profit of each task respectively. Calculate the maximum profit the dasher can earn. Each task needs to be scheduled before it starts; once a task starts, it cannot be interrupted. Ensure that non-overlapping tasks can yield higher profits.
Example
Input
1,3,6,2
3,5,7,4
50,10,40,70