Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 1.0 Seconds Memory Limit: 65536K

Total Runs: 857 Accepted Runs: 303 Multiple test files

Farmer John is an astounding accounting wizard and has realized he
might run out of money to run the farm. He has already calculated
and recorded the exact amount of money (1 ≤ *money*_{i} ≤ 10,000)
that he will need to spend each day over the next N (1 ≤ *N* ≤
100,000) days.
FJ wants to create a budget for a sequential set of exactly *M* (1
≤ *M* ≤ *N*) fiscal periods called "fajomonths". Each of these
fajomonths contains a set of 1 or more consecutive days. Every day
is contained in exactly one fajomonth. ### Input

* Line 1: Two space-separated integers: *N* and *M* ### Output

* Line 1: The smallest possible monthly limit Farmer John can afford
to live with. ### Sample Input

### Sample Output

### Input Details

There are 7 days to be spread across 5 fajomonths. He spends $100,
$400, $300, $100, $500, $101, and $400 on sequential days.
### Output Details

If Farmer John schedules the months so that the first two days are
a month, the third and fourth are a month, and the last three are
their own months, he spends at most $500 in any month. Any other
method of scheduling gives a larger minimum monthly limit.

FJ's goal is to arrange the fajomonths so as to minimize the expenses of the fajomonth with the highest spending and thus determine his monthly spending limit.

* Lines 2..*N* + 1: Line *i*+1 contains the number of dollars Farmer John
spends on the *i*th day

7 5 100 400 300 100 500 101 400

500

100 400 300 100 500 101 400 Daily spending ---1--- ---2--- -3- -4- -5- Month Number 500 400 500 101 400 Monthly spending

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz