map容器

试题链接：http://acm.hdu.edu.cn/showproblem.php?pid=1004

试题分析：本题如果使用预定义的map类会非常的方便

map定义：http://baike.baidu.com/view/4256069.htm?fr=aladdin

#include<iostream>
#include<map>
#include<string>

using namespace std;

int n,maxNum;
string a;
string maxColor;
map<string,int> ballon;
int main()
{

    while(cin>>n)
    {

        if(!n)break;
        maxNum = 0;
        ballon.clear();
        
       for(int i=0;i<n;i++){

    cin>>a;
                ballon[a]++;
        }
        map<string,int>::iterator ite;
        for(ite = ballon.begin();ite!=ballon.end();ite++){
            if(ite->second >maxNum){
                maxNum = ite->second;
                maxColor = ite->first;
            }
        }
        cout<<maxColor<<endl;
    }
    return 0;
}

#include <iostream>
#include <map>
#include <string>

using namespace std;
string a,maxColor;
map<string,int>zhangjie;
int main(){
    int n,maxNum;
    while(cin>>n&&n){
        maxNum = 0;
        zhangjie.clear();
    for(int i = 0;i < n;i++){
        cin>>a;
        zhangjie[a]++;
    }

    map<string,int>::iterator ite;
    for(ite = zhangjie.begin();ite!=zhangjie.end();ite++)
    {
    if(ite->second > maxNum){
    maxNum = ite->second;
    maxColor = ite->first;
    }
    }
    cout<<maxColor<<endl;
    }
    return 0;
}

 

 参考网址：http://blog.sina.com.cn/s/blog_4e7ae8ca0100xti7.html

#include <iostream>
#include <map>
#include <string>

using namespace std;
map<string ,int>String;
string zhangjie;
int main()
{
    int n;
    cin>>n;
    while(n--){
        cin>>zhangjie;
        if(String[zhangjie])cout<<zhangjie<<String[zhangjie]<<endl;
        else {cout<<"OK"<<endl;}
        String[zhangjie]++;
    }

    return 0;
}