USACO-Moo Operations

最新推荐文章于 2024-08-30 21:23:55 发布

善良的小乔

最新推荐文章于 2024-08-30 21:23:55 发布

阅读量97

点赞数

分类专栏： USACO题目文章标签： c++ USACO 算法 Powered by 金山文档

本文链接：https://blog.csdn.net/Annconda/article/details/128885869

版权

USACO题目专栏收录该内容

38 篇文章 0 订阅

订阅专栏

这篇文章描述了一个编程问题，Bessie需要将包含M和O的字符串转换成MOO，要求最小化操作次数。给定一系列字符串，程序需计算最少需要多少次替换或删除操作，或者在不可能的情况下输出-1。提供的C++代码示例用于解决这个问题。

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

题目描述（没有中文！）：

Because Bessie is bored of playing with her usual text string where the only characters are 'C,' 'O,' and 'W,' Farmer John gave her Q� new strings (1≤Q≤1001≤�≤100), where the only characters are 'M' and 'O.' Bessie's favorite word out of the characters 'M' and 'O' is obviously "MOO," so she wants to turn each of the Q� strings into "MOO" using the following operations:

Replace either the first or last character with its opposite (so that 'M' becomes 'O' and 'O' becomes 'M').

Delete either the first or last character.

Unfortunately, Bessie is lazy and does not want to perform more operations than absolutely necessary. For each string, please help her determine the minimum number of operations necessary to form "MOO" or output −1−1 if this is impossible.

INPUT FORMAT (input arrives from the terminal / stdin):

The first line of input contains the value of Q�.

The next Q� lines of input each consist of a string, each of its characters either 'M' or 'O'. Each string has at least 1 and at most 100 characters.

OUTPUT FORMAT (print output to the terminal / stdout):

Output the answer for each input string on a separate line.

SAMPLE INPUT:

MOMMOM

MMO

MOO

SAMPLE OUTPUT:

-1

A sequence of 44 operations transforming the first string into "MOO" is as follows:

Replace the last character with O (operation 1)

Delete the first character (operation 2)

The second string cannot be transformed into "MOO." The third string is already "MOO," so no operations need to be performed.

代码如下：

#include<bits/stdc++.h>
using namespace std;
int q;
char a[1001]={};
int main(){
	cin>>q;
	while(q--){
		cin>>a;
		int z=strlen(a),s=-1,flag=0;
		for(int i=0;i<z-2;i++){
			if(a[i]=='M'&&a[i+1]=='O'&&a[i+2]=='O'){
				s=z-3;
				break;
			}
			else if(a[i]=='M'&&a[i+1]=='O'&&a[i+2]=='M'){
				if(s<0){
					s=z-2;
				}else{
					s=min(s,z-2);
				}
				
			}
			else if(a[i]=='O'&&a[i+1]=='O'&&a[i+2]=='O'){
				if(s<0){
					s=z-2;
				}else{
					s=min(s,z-2);
				}
			}else if(a[i]=='O'&&a[i+1]=='O'&&a[i+2]=='M'){
				if(s<0){
					s=z-1;
				}else{
					s=min(s,z-1);
				}
			}else{
				if(s<0) s=-1;
			}
			
		}
		cout<<s<<endl;
		
	}
	return 0;
}