RPLB - Blueberries

Teresa picked up enough strawberries, now she wants to pick blueberries from the magical blueberry bush from Rainbowland.

Knowing her previous experience with the strawberries, Teresa wants to pick up the blueberries in a way that she may not exceed the limit proposed.

When picking the blueberries, she noticed that if she pick from the bush i, she couldn't pick the blueberries at the bush i+1 (some sort of magic in rainbowland).

Worried about this, Teresa wants to know the maximum blueberries she can pick, given the number of bushes and the number of blueberries in each bush.


Will contain an integer T, then, T cases will follow, each case starts with a number N and K, being N the number of bushes and K the number of blueberries Teresa will pick as maximum, the next line contains N integers, each one representing the blueberries there is on the i-th bush.


You will output for each test case the string: “Scenario #i: “ where i is the test case you are analyzing, then, an integer denoting the maximum number of blueberries you can grab.


5 100
50 10 20 30 40
5 87
21 45 30 12 14

Scenario #1: 90
Scenario #2: 65

Output explanation (first scenario)

Teresa picks the 1st blueberry bush (50), she cannot pick the 2nd, she decides not to pick until the 5th one where she picks the “40” blueberry, she could pick the 3rd bush, but she would exceed the limit (100).

Output explanation (second scenario)

Teresa picks the 1st, the 3rd and the 5th bush, total of (21+30+14 = 65) blueberries


1 <= N <= 1000
1 <= K <= 1000

hide comments
cichipi_: 2017-06-09 16:37:46

take ith one recall x = fun(i+2 , lim+a[i])
don't take ith one, y = fun(i+1 , lim)
return the max of them
it will get TLE....as it computing same state once more
so , we take dp[1007][1007] = -1 all
inside the function if dp[i][limit]!=-1 then we need not copute it again....we just return dp[i][lim]
finally return dp[i][limit] = max(x,y);

Last edit: 2017-06-09 16:40:25
don_1234: 2017-04-01 14:03:02

Use Fast i/o in java cost me 1 tle

Last edit: 2017-04-01 14:04:24
manas0008: 2017-02-05 07:12:38

Start afresh

and realise it's no more than knapsack at the end.

mkfeuhrer: 2017-02-02 22:05:47

its just 0 - 1 knapsack ! ! dont thnk much :-P . check print format !!

tni_mdixit: 2017-01-18 15:34:34

O/p format cost 2 WA . EASY!

vengatesh15: 2016-12-29 10:16:57

AC in 1 go :-)

Joker: 2016-10-01 19:07:57

F**k there is a space between colon and answer

adichd123: 2016-08-08 15:32:27

combination of two classic dp problems!!

akashmandal21: 2016-06-01 22:55:37

Thanks @Shashank Tiwary...ur test case helped me in finding my mistake :)

sanjay: 2016-05-28 17:00:40

simple BOTTOM UP DP !!!! AC in first go!!!Thanks to the author. Dont confuse after reading the problem.just think like knapsack 0/1.

Added by:david_8k
Time limit:0.439s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own Problem used for the RPL contest