Consider a game, in which you have two types of powers, A and B and there are 3 types of Areas X, Y and Z. Every second you have to switch between these areas, each area has specific properties by which your power A and power B increase or decrease. We need to keep choosing areas in such a way that our survival time is maximized. Survival time ends when any of the powers, A or B reaches less than 0.
Initial value of Power A = 20 Initial value of Power B = 8 Area X (3, 2) : If you step into Area X, A increases by 3, B increases by 2 Area Y (-5, -10) : If you step into Area Y, A decreases by 5, B decreases by 10 Area Z (-20, 5) : If you step into Area Z, A decreases by 20, B increases by 5 It is possible to choose any area in our first step. We can survive at max 5 unit of time by following these choice of areas : X -> Z -> X -> Y -> X
This problem can be solved using recursion, after each time unit we can go to any of the area but we will choose that area which ultimately leads to maximum survival time. As recursion can lead to solving same subproblem many time, we will memoize the result on basis of power A and B, if we reach to same pair of power A and B, we won’t solve it again instead we will take the previously calculated result.
Given below is the simple implementation of above approach.
This article is contributed by Utkarsh Trivedi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Maximum value with the choice of either dividing or considering as it is
- Largest area rectangular sub-matrix with equal number of 1's and 0's
- Maximum sub-matrix area having count of 1's one more than count of 0's
- Find the largest area rectangular sub-matrix whose sum is equal to k
- Count minimum number of moves to front or end to sort an array
- Maximum subsequence sum such that no K elements are consecutive
- Count possible splits of sum N into K integers such that the minimum is at least P
- Paths requiring minimum number of jumps to reach end of array
- Length of longest increasing absolute even subsequence
- Count N digits numbers with sum divisible by K
- Maximize length of longest increasing prime subsequence from the given array
- Longest increasing subsequence which forms a subarray in the sorted representation of the array
- Maximum score assigned to a subsequence of numerically consecutive and distinct array elements
- Maximum subsequence sum possible by multiplying each element by its index