DISCLAIMER: This problem statement contains NO spoilers to the film Avengers: Endgame and is in no way shape or form affiliated to Marvel Entertainment. Uses of characters, settings, and scenes are parodical only.
Thanos wants to balance the universe, but the pesky Avengers keep getting in his way. He's hired you, a computer scientist, to help him obtain the infinity stones. Help him find them, and it will put a smile on his face.
The planets in Thanos' path can be represented with an ~N~-sized array. There are ~M~ infinity stones scattered on different planets throughout the universe. Thanos needs to collect all of the infinity stones, but he does not want to spend too much time doing so, as the Avengers are going after him and he wants to settle down on his farm. Every time he collects a stone, he has to stop for 1 minute (to fight some Avengers, sacrifice Gamora, etc.), but he does not need to spend time travelling between planets due to cutting-edge alien technology.
Since many other people have been collecting these stones, many of the stones are near each other. Thanos can use his minions to collect multiple adjacent stones (stones that are next to each other in an array) in one trip.
Calculate the minimum amount of time, in minutes, for Thanos to collect all ~M~ infinity stones, and he will hope that they remember you.
The first line of input will contain two space-separated integers: ~N~ and ~M~
The next ~N~ lines will each contain a single digit: either ~0~ or ~1~, representing the number of infinity stones on the ~i~th planet.
A single integer: the minimum amount of time that Thanos and his minions need to collect all the infinity stones.
10 6 0 1 1 0 1 0 0 1 1 1
The stones at index 1 and 2 are adjacent, which increments the time by 1. The stone at index 4 is on its own, so Thanos must collect it by itself, incrementing the time by 1 again. The stones at indices 7, 8 and 9 are all adjacent to one another, and so the time increments by only 1. The final total time is 3.