ACM PKU 2328 http://acm.pku.cn/JudgeOnline/problem?id=2328

#include<iostream>
#include<string>
using namespace std;
int main()
{
char abc[20];
int n , max[100] , min[100] , i = 0 , j = 0 , k, cnt = 0 ,number = 0;

while(cin>>n)
{
   number++; 

   if(number == 1 && n == 0)
    return 0;

   getchar();
   gets(abc);


   if( !strcmp("too high",abc) )
    max[i++] = n;

   if( !strcmp("too low",abc) )
    min[j++] = n;

   if( !strcmp("right on",abc) )
   {
   
    for( k = 0 ; k < i ; k++)
    {
     if( max[k] <= n )
     {cout<<"Stan is dishonest"<<endl;cnt = 1;break;}
    }
    if(!cnt)    
     for( k = 0 ; k < j ; k++ )
     {
      if( min[k] >= n)
      {cout<<"Stan is dishonest"<<endl;cnt = 1;break;}
     }
     if(!cnt || number == 1) 
      cout<<"Stan may be honest"<<endl;
    
     memset(max,0,100);
     memset(min,0,100);
     cnt = 0;
     i = 0;
     j = 0;
     number = 0 ;
    
   } 
}

return 0;
}

转载于:https://www.cnblogs.com/Chinese-Coder-Clarence/articles/2039347.html