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.
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 integers 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
vedaniks_16:
2016-09-12 14:06:56
@dush1729 @Dushyant Singh
|
|
love11mishra:
2016-08-28 00:53:19
:) yaa...
|
|
mkfeuhrer:
2016-07-05 14:27:09
LIS problem with one more condition!!
|
|
Dushyant Singh:
2016-03-06 15:12:45
Correct me if I am wrong.
|
|
randomguy00:
2016-02-19 21:06:08
He can't carry the bat mobile!!! :'(
|
|
sai krishna:
2016-02-03 19:30:32
Standard LIS with Little Variation |
|
The_ROCK:
2015-08-19 07:17:03
Some clarifications:
|
|
thewatch:
2015-07-03 00:04:02
while using the mini-BAT can the batman jump over multiple peaks ie pass one peak
|
|
dunnohyet:
2014-05-22 09:23:24
how can batman cross the last peak without jumping on it??
|
|
Guilherme Sena:
2014-03-13 19:20:47
If he can't carry the bat and has to use it in the peak in which robin is, how can the solution 4 in the test case be possible? The only possible (maximum) paths are: 6-3, 3, 5-3, 5-2, 2, 4-2, 4, and 5-4-2, none of which results in 4. Does batman count in the army as well? |
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 |