9 teams scored 236 points on this task, for a maximum score of 54, an average score of 26 and a median score of 13.
Fearsome William is once again escaping from the police, this time through Robbery Highway! Robbery Highway is exactly N-1 kilometers long, and has an interesting peculiarity: at every kilometer there is a bank. From his network of informants, William knows that the i-th bank has exactly S_i million euros in its vault. Obviously William never misses an opportunity, so he decided to rob one or more banks during his escapes. William's plan consists of two simple rules: (1) never go back to not get caught: after robbing bank x, he can rob bank y only if y > x; (2) always rob the bank with more money: he will always choose the bank with the maximum S_i among the banks he can rob (in case of ties he will chose the latest). Furthermore, the banks continue to move their money trying to prevent theft. Luckily, William has obtained a list with the next Q transactions, after each transaction, the bank p will have s millions in its vault...