干草堆 - المسألة

#3468. 干草堆

الإحصائيات

تم استخدام هذه المسألة في المسابقات التالية:

KTH Challenge 2016

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

Peter 排列了一排干草捆。一些干草捆带有寄生虫，他想把受感染的干草捆移到序列的末尾，以尽量减少寄生虫传播的机会。为了整理这些干草捆，他可以重复执行以下操作：取出任意三个连续的干草捆，并将它们按顺序重新放回。你的任务是计算 Peter 为了整理该序列所需执行的最少操作次数。

图片由 stanze 提供

输入格式

输入包含一个字符串 $s$ ($3 \le |s| \le 500$)，表示干草捆的序列。$s$ 中的每个字符要么是 'C'（表示干净的干草捆），要么是 'P'（表示受感染的干草捆）。

输出格式

输出必须包含一个整数，即 Peter 所需执行的最少操作步数。

样例

输入 1

CPCC

输出 1

输入 2

PPPPCCCC

输出 2

输入 3

CCCCPPPP

输出 3

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0