A beetle finds itself on a thin horizontal branch. “Here I am on a thin horizontal branch,” thinks the
beetle, “I feel pretty much like on an x-axis!” It surely is a beetle of deep mathematical thought.
There are also n drops of dew on that same branch, each holding m units of water. Their beetle–based
integer coordinates are x1, x2, . . . , xn.
It is clear that the day will be hot. Already in one unit of time one unit of water goes away from each
drop. The beetle is thirsty. It is so thirsty that if it reached a drop of dew it would drink it in zero time.
In one unit of time the beetle can crawl one unit of length. But would all this crawling pay off? That’s
what buzzes the beetle.
So you are to write a program which, given coordinates of dew drops, calculates the maximal amount
of water the beetle can possibly drink.
There are multiple test cases in the input file. For each test case:
The input is read from standard input. The first line contains two integers n and m. The next n lines
contain integer coordinates x1, x2, ... , xn.
(0<=n<=300, 1<=m<=1000000, -10000<=x1,x2, ..., xn<=10000, all the xi are distinct.)
The program should write one line to standard output containing a single integer: the maximal amount
of water the beetle can possibly drink.
3 15 6 -3 1 3 15 6 -3 1
25 25
Migrated from old NTUJ.
BOI2009
| No. | Testdata Range | Score |
|---|