杭电3617Happy 2009

Happy 2009

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2727    Accepted Submission(s): 914

Problem Description

No matter you know me or not. Bless you happy in 2009.

 

Input

The input contains multiple test cases.
Each test case included one string. There are made up of ‘a’-‘z’ or blank. The length of string will not large than 10000. 

 

Output

For each test case tell me how many times “happy” can be constructed by using the string. Forbid to change the position of the characters in the string. The answer will small than 1000.

 

Sample Input

  
  

   
   hopppayppy happy
happ acm y
hahappyppy
  
  

 

Sample Output

  
  

   
   2
1
2
  
  

 

Author

yifenfei

 

Source

奋斗的年代

 

Recommend

yifenfei   |   We have carefully selected several similar problems for you:   2608  2637  1421  2634  2822 

 

直接算就行了，算法时间复杂度为n；

附ac代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int h,a,p,i,m,n,j,k,l,y,help;
char s[110000];
int main()
{
	while(gets(s))
	{
		l=strlen(s);
		h=a=p=y=help=0;
		for(i=0;i<l;i++)
		{
			if(s[i]=='h')
			h++;
			if(s[i]=='a')
			{
				if(a<h)
				{
					a++;
					help+=2;
				}
			}
			if(s[i]=='p')
			{
				if(p<help)
				p++;
			}
			if(s[i]=='y')
			{
				if(y<p/2)
				y++;
			}
		}
		printf("%d\n",y);
	}
	return 0;
}