Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Running
Description The cows are trying to become better athletes, so Bessie is running on a track for exactly The ultimate distance Bessie runs, though, depends on her 'exhaustion factor', which starts at 0. When she chooses to run in minute D ≤ 1,000) and her exhaustion factor will increase by 1 -- but must never be allowed to exceed _{i}M (1 ≤ M ≤ 500). If she chooses to rest, her exhaustion factor will decrease by 1 for each minute she rests. She cannot commence running again until her exhaustion factor reaches 0. At that point, she can choose to run or rest.At the end of the Find the maximal distance Bessie can run. Input * Line 1: Two space-separated integers: Output * Line 1: A single integer representing the largest distance Bessie can run while satisfying the conditions. Sample Input 5 2 5 3 4 2 10 Sample Output 9 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator