Question

2. Super Mario must travel through a landscape made up of n spaces each filled with a mushroom, a spike or nothing. He wishes to reach the princess who is on space n. Super Mario can choose to advance 1 step or jump J steps. To start, J- 2, if he lands on a space that has a mushroom then J increases by You are given an array of the landscape L1,.., n] such that L] N if there is nothing on space i, LM if there is a mushroom on space i and LliS if there is a spike on space i. Design an algorithm that returns the minimum number of actions needed (jump or advance) for Super Mario to reach space n without hitting a spike.

Answer 1

Supo Masio f'roblem n his problem we need to Find oud thu jump os action neeoleol to veash, thi hth jump. To let's find out minimum rumbor of actions needesd Super MMsu For every index lecs tRan or egual toi then theo will be jump wtich ii+" Mean mini mum nunben of adions to aut index is i1 we can see supen Mario an reash position iti from somuuuturu wkich has index less thon i+1' eit by jumping som stepes o b 1 2 34.7 1i+1 j) denotes the auwe of tu problem to indeyi wfou sperMaro has reached by tapiny. previous jump i step We need to Unde-staud teuse 3 diffeseid. Cons

Ceuse 1: for 1 toj- ト(t)1+1): トし1.31+1; for (3-toj-i ト[i,j-i): ト(i, j) + 1 ., Base Cars We have to initialise 11.3)ニINF , for all Possible valus of i, j jニ2 initially, ト(0,2):0 f ( o , 1):0, ,