1405.cpp

来自「ZOJ 动态规划算法题目入门与提高 源代码」· C++ 代码 · 共 41 行

#include<iostream>
#include<fstream>

using namespace std;

int p[26];

int main()
{
    //ifstream cin("in.txt");
    int N;
    string s;
    while(cin>>N && N)
    {
        cin>>s;
        memset(p,0,sizeof(0));
        int ans = 0,num=0;
        for(int i=0;i<s.length();i++)
        {
            if(p[s[i]-'A']==0) 
            {
                if(num < N) {num++;p[s[i]-'A']=1;}
                else if(num==N)
                {
                    ans++;
                    p[s[i]-'A']=2;                   
                    
                } 
            }
            else if(p[s[i]-'A']==1)
            {
                num--;
                p[s[i]-'A']=0;
            }
            else if(p[s[i]-'A']==2) p[s[i]-'A'] = 0;
        }
        if(ans==0) cout<<"All customers tanned successfully.\n";
        else cout<<ans<<" customer(s) walked away.\n";
    }
}