Programming Principles 1. Week 6. October 7 - 13. PART 2
A train contains sleeping cars, marked with letter k, and sitting cars, marked with letter p. Find the biggest number of sleeping cars that follow each other in the train.
One line contains a sequence of letters k and p, with length from 1 to 1000 characters.
Print the maximum number of seeping cars that follow each other.