Strings of Power

Volodya likes listening to heavy metal and (occasionally) reading. No wonder

Volodya is especially interested in texts concerning his favourite music style.

Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Finding all powerful substrings (by substring Volodya means a subsequence of consecutive characters in a string) in a given text makes our hero especially joyful. Recently he felt an enormous fit of energy while reading a certain text. So Volodya decided to count all powerful substrings in this text and brag about it all day long. Help him in this difficult task. Two substrings are considered different if they appear at the different positions in the text.

For simplicity, let us assume that Volodya's text can be represented as a single string. 

输入格式

Input contains a single non-empty string consisting of the lowercase Latin alphabet letters. Length of this string will not be greater than 1e6 characters. 

输出

Print exactly one number — the number of powerful substrings of the given string. 

样例输入

heavymetalisheavymetal
heavymetalismetal
trueheavymetalissotruewellitisalsosoheavythatyoucanalmostfeeltheweightofmetalonyou

样例输出

3
2
3

 

我觉得这道题只要一直搜索下去就好了。

代码如下：

#include<iostream>
#include<cstring>
using namespace std;

const int MAXN=1000010;
char str[MAXN];
int main(void)
{
 memset(str,0,sizeof(str));
 int i;
 while(cin>>str)
 {
  int len=strlen(str);
  int sum=0;
  int count=0;
  for(i=0;i<len;i++)
  {
   if(str[i]=='h'&&str[i+1]=='e'&&str[i+2]=='a'&&str[i+3]=='v'&&str[i+4]=='y')
   {
    i+=4;
    count++;
   }
   else if(str[i]=='m'&&str[i+1]=='e'&&str[i+2]=='t'&&str[i+3]=='a'&&str[i+4]=='l')
   {
    i+=4;
    sum=sum+count;
   }
  }
  cout<<sum<<endl;
  memset(str,0,sizeof(str));
 }
 return 0;
}