AutoRickshaw Fare Bracket Optimization
AutoRickshaw Fare Bracket Optimization
HardArrays0% accepted
An auto in Bangalore records checkpoint distances. The fare system charges per bracket non-linearly: breaking a journey into segments increases total fare. Find maximum fare by optimal breakpoints.
Approach
Given an array of cumulative checkpoint distances, partition into segments to maximize total fare where fare per segment = distance². Find the maximum total fare.
Input
4
1 3 6 10
Output
50
More Arrays problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards