## CCC '07 S5 - Bowling for Numbers

View as PDF

Points: 10 (partial)
Time limit: 2.0s
Memory limit: 256M

Problem type
##### Canadian Computing Competition: 2007 Stage 1, Senior #5

At the Canadian Carnival Competition (CCC), a popular game is Bowling for Numbers. A large number of bowling pins are lined up in a row. Each bowling pin has a number printed on it, which is the score obtained from knocking over that pin. The player is given a number of bowling balls; each bowling ball is wide enough to knock over a few consecutive and adjacent pins.

For example, one possible sequence of pins is: 2 8 5 1 9 6 9 3 2

If Alice was given two balls, each able to knock over three adjacent pins, the maximum score Alice could achieve would be , the sum of two throws: , and .

Bob has a strategy where he picks the shot that gives him the most score, then repeatedly picks the shot that gives him the most score from the remaining pins. This strategy doesn't always yield the maximum score, but it is close. On the test data, such a strategy would get a score of 20%.

#### Input Specification

Input consists of a series of test cases. The first line of input is , , indicating the number of test cases in the file. The first line of each test case contains three integers n k w. First is the integer , , indicating the number of bowling pins. The second integer, , , giving the number of bowling balls available to each player. The third and final integer is , , the width of the bowling ball (the number of adjacent pins it can knock over). The next lines of each test case each contain a single non-negative integer less than , giving the score of the pins, in order. 20% of the test data will have size .

#### Output Specification

For each test case, output the maximum achievable score by the player. This score is guaranteed to be less than one billion.

#### Sample Input

1
9 2 3
2
8
5
1
9
6
9
3
2

#### Output for Sample Input

39