洛谷-P1321-单词覆盖还原

单词覆盖还原 - 洛谷

---

#include<bits/stdc++.h>
using namespace std;
int main()
{
	string a;
	int sum1=0,sum2=0;
	cin>>a;

	for(int i=0;i<=a.length()-1;i++)//遍历字符串 
	{
		if(a[i]=='b'&&a[i+1]=='o'&&a[i+2]=='y')//如果是连续的boy 
		{
			i=i+2;//跳到y的下一个字符 
			sum1++;//数量加1 
		}
		else if(a[i]=='b'&&a[i+1]=='o')//如果是连续的bo 
		{
			i=i+1;
			sum1++;
		}
		else if(a[i]=='o'&&a[i+1]=='y')//如果是连续的oy 
		{
			i=i+1;
			sum1++;
		}
		else if(a[i]=='b'||a[i]=='o'||a[i]=='y')//如果当前位置是b或者o或者y 
		sum1++;
		else if(a[i]=='g'&&a[i+1]=='i'&&a[i+2]=='r'&&a[i+3]=='l')//以上同理 
		{
			sum2++;
			i=i+3;
		}
		else if(a[i]=='g'&&a[i+1]=='i'&&a[i+2]=='r')
		{
			sum2++;
			i=i+2;
		}
		else if(a[i]=='i'&&a[i+1]=='r'&&a[i+2]=='l')
		{
			sum2++;
			i=i+2;
		}
		else if(a[i]=='g'&&a[i+1]=='i'||(a[i]=='i'&&a[i+1]=='r')||(a[i]=='r'&&a[i+1]=='l'))
		{
			sum2++;
			i++;
		}
		else if(a[i]=='g'||a[i]=='i'||a[i]=='r'||a[i]=='l')
		sum2++;
	}

	cout<<sum1<<endl<<sum2;
	return 0;
}