BAT3 - BATMAN3


 

"
Bruce Wayne: I do fear death. I fear dying in here while my city burns. 
Blind Prisoner: Then make the climb.
Bruce Wayne: How?
Blind Prisoner: As the child did. Without the rope. Then fear will find you again.
"

 

" Bruce Wayne: I do fear death. I fear dying in here while my city burns.
 Blind Prisoner: Then make the climb.
 Bruce Wayne: How?
 Blind Prisoner: As the child did. Without the rope. Then fear will find you again. "

 


The Epic fight between BANE and BATMAN saw BATMAN on the losing side .Bane delivers a crippling blow to Batman's back, then takes him to a foreign, well-like prison where escape is virtually impossible .

The prison as we know is a place from where no man ever escaped , except for the child of Ra's al Ghul himself . 

The heroics of BATMAN saw him escape the prison , however after the prison came the Valleys . To reach the city , He needed to cross these valleys . Meanwhile , BANE's army has surrounded the city and trapped all the policemen underground . Each of these peaks contain exactly one policeman held captive by Bane's men. Since, BATMAN needs to build his own army , he decides to free some of the policemen on his way . 

Also BATMAN needed to save his energy before his battle with Bane ,so he decided to take only downhill (strictly) jumps .Detective John Blake ( now called as ROBIN ) is standing in one of these peaks with a mini-BAT . This will allow BATMAN to take a maximum one jump uphill ahead . BATMAN can choose to flee ROBIN and use the BAT or rather cross over without his help .

The task in hand is to maximize the army strength to face BANE as BATMAN crosses over.
(BATMAN can take his first jump on any of these peaks)

 

" Bane : So, you came back to die with your city. 
   Batman : No. I came back to stop you


Input

 

t , number of testcases
n : number of peaks ,  m : (zero based)index of the peak where ROBIN is standing
n intergers denoting the height of the peaks   

 

Output

 

The maximum strength of the army

 

Constraints :

1<=n<=1000

 

 

Example

Input:
1
6 4
6 3 5 2 4 5
Output:
4

hide comments
luka_dzimba911: 2017-12-28 17:14:45

For those who are getting WA batman does not need to cross the city you need to find max out of all endings not at the end of city , costed me 1 WA

1
8 7
65 22 3 4 2 1 2 45
ans --> 5 not 2
65 45 if he needs to cross
65 22 4 2 1 if he doesnt need to cross

Last edit: 2017-12-28 17:15:15
kshubham02: 2017-09-01 07:52:22

Got 2 WA assuming Batman could use the mini-bat anytime after he had acquired it :(
Remember, he can use it only off the peak where Robin is standing.

yaswanth: 2017-07-20 05:01:37

It should be clearly stated the batman doesn't need to jump on the last peek. He has to get maximum possible policeman on his side that's all.

coolio_1: 2017-07-14 15:04:02

Nice logic! Also if it may help at all, batman can take the uphill jump only
once and that too from the one where ROBIN awaits him. He cannot use the bat to jump off any other hill that occurs later.

Last edit: 2017-07-14 15:07:21
bharanidharan1: 2017-06-09 15:37:49

After a series of dp!!First time AC in one go....

sandip_coder: 2017-04-03 22:15:03

1
9 5
8 4 5 3 10 5 6 7 2000 1999
Answer will be 4 not 3

vengatesh15: 2017-03-04 07:50:35

AC in 1 go:-)

prasoonbatham: 2017-01-25 13:40:07

easy one :)

vedaniks_16: 2016-09-12 14:06:56

@dush1729 @Dushyant Singh
you are entering n=9 and {8 4 5 3 10 5 6 7 2000 1999} these are 10 elements.
enter input as
1
10 5
8 4 5 3 10 5 6 7 2000 1999
and you will get answer as 4.

love11mishra: 2016-08-28 00:53:19

:) yaa...
LIS with a relaxation in a particular case.


Added by:Romal Thoppilan
Date:2013-02-06
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:own problem