Farmer John has arranged hisN(1 ≤N≤ 5,000) cows in a row and many of them are facing forward, like good cows. Some of them are facing backward, though, and he needs them all to face forward to make his life perfect.
Fortunately, FJ recently bought an automatic cow turning machine. Since he purchased the discount model, it must be irrevocably preset to turnK(1 ≤K≤N)cows at once, and it can only turn cows that are all standing next to each other in line. Each time the machine is used, it reverses the facing direction of a contiguous group ofKcows in the line (one cannot use it on fewer thanKcows, e.g., at the either end of the line of cows). Each cow remains in the same*location*as before, but ends up facing the*opposite direction*. A cow that starts out facing forward will be turned backward by the machine and vice-versa.
Because FJ must pick a single, never-changing value ofK, please help him determine the minimum value ofKthat minimizes the number of operations required by the machine to make all the cows face forward. Also determineM, the minimum number of machine operations required to get all the cows facing forward using that value ofK.
，但我们好多人没想过，勇敢的冷静的理智的去接受失败，
