|x - y|WHO suggest that COVID always affects itself. Note that a virus can never affect stronger viruses. In one second,simultaneously, each virus V is replaced with a virus whose type is the...

Extracted text: Assume that there are 10 types of COVID-19 strains, having one type with strength 0 to the last type with strength 9. WHO examines the behaviour of a row of N viruses, indexed 1 through N. The initial situation is represented by a string S that consists of N digits, denoting the strengths of the viruses. Stronger strain of COVID viruses will slowly defeat the weaker ones and convert them into their own type. While it's easy for a very strong virus to defeat a very weak one, the distance between them is an obstacle. Formally, we say that a virus with index x affects a virus with index y (1|x - y| WHO suggest that COVID always affects itself. Note that a virus can never affect stronger viruses. In one second, simultaneously, each virus V is replaced with a virus whose type is the strongest among all the viruses that were affecting V at that moment. WHO wants to know when this process will stop, i.e., when all N viruses will have the same type. Can you help World Health Organisation to develop a C++ code and compute the number of seconds after which the process will stop? Input: 1 555755555 Output: 3