Consider a row of n houses represented as an array A[l ..n], where the phrase \"
ID: 3595282 • Letter: C
Question
Consider a row of n houses represented as an array A[l ..n], where the phrase "next door neighgbor" having its natural meaning. Each resident is assigned a "fun factor" F[1.....n,] which represents how much fun they bring to a party. Your goal is to maximize the fun of a party that you are arranging, but with the constraint that you cannot select three consecutive neighbors. (So for example, if you invite the A[5] and A[6] family, you cannot invite the A[4] or A[7] families.) Give an efficient algorithm to select the quest list.
Explanation / Answer
What we can do is we can use python language to create a dictionary.
A dictionary is a data type that works on key-value pairs..example ---->>>> (house1:100, house2: 80 house3: 70)
now after we have assigned each house in accordance to its corrosponding fun factor now we have to sort the fun factors in descending order.
skipping one value after taking 2 values (i,e take value1 and value 2 skip value 3 then take value 4 and value 5 skip value 6 ) this will result in maximizing the fun factor as the fun is ordered in descending order
now just put the house number corrosponding to values taken in an array and print it.
this is one of the algorithm in which way this question can be done