[Algorithm Analysis]

Suppose two polices are planning to raid into houses along a street as they have information that each house has a certain amount of black money. All houses along the street are arranged in a circle [the rst house is the neighbor of the last one]. But there is a constraint. All the householders are criminals and are friends in this street. So, if they raid adjacent houses,the house owners would contact between themselves and all the householders would ee away.

You have to help the police. You have the information about the amount of money of each house. Provide an algorithm to the police so that they can use it to rescue maximum amount of black money and catch their owners.