Max Robots in Budget

You have n robots. Given arrays chargeTimes and runningCosts (both length n), and an integer budget, the cost to run robots from index l to r is max(chargeTimes[l..r]) + sum(runningCosts[l..r]) * (r - l + 1). Return the maximum number of consecutive robots you can run without exceeding budget.

Examples
Input: [[3,6,1,3,4],[2,1,3,4,5],25]
Output: 3
Hints

Max Robots in Budget

You have n robots. Given arrays chargeTimes and runningCosts (both length n), and an integer budget, the cost to run robots from index l to r is max(chargeTimes[l..r]) + sum(runningCosts[l..r]) * (r - l + 1). Return the maximum number of consecutive robots you can run without exceeding budget.