## BATMAN3

Link to the question : BAT3

### HINT :

I would suggest you to try the longest increasing sub sequence problem first. You can also check the algorithm for LIS in geeksforgeeks.org.

If you have idea of LIS, then the question must be easy for you. In this we need to find the longest decreasing subsequence but with a change that we can jump one big number if we are on the Robin's number (as given in the question). Hence, we just need to add batman can go to next cliff its smaller than the present or batman is standing on the Robin's peak (then he can go to any peak).

#### RECOMMENDED QUESTION :

Try another dp question .

### SOURCE CODE :

/* Batman3 */ /* Sushant Gupta */ #include<stdio.h> int main() { int t; scanf("%d",&t); while(t--) { int n,m; scanf("%d%d",&n,&m); int i,arr[n]; for(i=0;i<n;i++) scanf("%d",&arr[i]); int lis[n],j; for ( i = 0; i < n; i++ ) lis[i] = 1; /* Compute optimized LIS values in bottom up manner */ for ( i = 1; i < n; i++ ) for ( j = 0; j < i; j++ ) if ( (arr[i] < arr[j] || j==m )&& lis[i] < lis[j] + 1) lis[i] = lis[j] + 1; int max =0; /* Pick maximum of all LIS values */ for ( i = 0; i < n; i++ ) {if ( max < lis[i] ) max = lis[i]; // printf("li = %d\n",lis[i]); //check } printf("%d\n",max); } return 0; }

This comment has been removed by the author.

ReplyDeleteThis comment has been removed by the author.

Delete