POJ3276—Face The Right Way 【常用技巧—反转（开关问题）】

最新推荐文章于 2020-12-19 09:25:46 发布

杏花疏影里_吹笛到天明

最新推荐文章于 2020-12-19 09:25:46 发布

阅读量390

点赞数

分类专栏：技巧

本文链接：https://blog.csdn.net/CQBZLYTina/article/details/79222871

版权

这篇博客探讨了在 Farmer John 的农场中，如何使用只能连续反转 K 头牛的机器来让所有牛朝向前方的问题。文章通过分析反转特性和避免重复反转，提出了一种基于枚举 K 值的解决方案，以找到最小的 K 和最小的操作次数 M。样例输入和输出展示了如何应用这种方法解决具体问题。

摘要由CSDN通过智能技术生成

Face The Right Way
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 5944 Accepted: 2749

Description

Farmer John has arranged his N (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 presetto turn K (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 isused, it reverses the facing direction of a contiguous group of K cows in the line (one cannot use it on fewer than K cows, e.g., at theeither 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 of K, please help him determine the minimum value of K that minimizes the number of operations required by the machine to make all the cows face forward.Also determine M, the minimum number of machine operations required to get all the cows facing forward using that value of K.