POJ 3276 Face The Right Way（开关，反转）详解（尺取+枚举两种做法）

最新推荐文章于 2021-11-02 16:21:40 发布

键盘里的青春

最新推荐文章于 2021-11-02 16:21:40 发布

阅读量1.6k

点赞数 3

分类专栏： ACM技巧 ACM 文章标签：尺取枚举开关反转

本文链接：https://blog.csdn.net/qq_34374664/article/details/53028870

版权

农夫约翰让他的奶牛排成一行，一些牛面向前方，一些面向后方。他购买了一台自动转向机，能一次性翻转K头相邻的奶牛。目标是最小化操作次数使所有奶牛面向前方。通过分析，可以发现从左到右遍历并考虑每头牛的状态，更新依赖关系或使用尺取法计算影响次数是关键。

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

Face The Right Way

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 4410		Accepted: 2045

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 preset to 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 is used, 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 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 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.

Input

Line 1: A single integer: N
Lines 2.. N+1: Line i+1 contains a single character, F or B, indicating whether cow i is facing forward or backward.

Output

Line 1: Two space-separated integers