zoj 2104
2013-08-17 15:03
696 查看
这题比较简单,用map<string,int>保留不同颜色气球对应的数量,最后用迭代器遍历一遍找出数量最多的气球就能轻松解决。
#include<iostream> #include<map> using namespace std; int main() { int s,m; string c,most; while((cin>>s)&&s!=0) { map<string,int> balloon; for(int i=0;i<s;i++) { cin>>c; ++balloon[c]; } map<string,int>::iterator iter=balloon.begin(); m=0; for(;iter!=balloon.end();iter++) { if(m<(iter->second)) { m=iter->second; most=iter->first; } } cout<<most<<endl; } return 0; }
相关文章推荐
- ZOJ 2104解题报告
- zoj 2104 Let the Balloon Rise(map映照容器的应用)
- zoj 2104 Let the Balloon Rise
- ZOJ 2104/HDU 1004 Let the Balloon Rise(map容器)
- ZOj 2104——Let the Balloon Rise
- ZOJ 2104
- ZOJ_2104_Let the Balloon Rise
- ZOJ_2104_Let the Balloon Rise
- zoj2104
- ZOJ 2104 Let the Ballon Rise(map解法)
- ZOJ 2104 Let the Balloon Rise
- zoj 2104 Let the Balloon Rise
- ZOJ2104 Let the Balloon Rise
- zoj 2104 Let the Balloon Rise
- zoj 2104.Let the Balloon Rise
- 主席树/函数式线段树/可持续化线段树 POJ_2104,BZOJ_1901,ZOJ_2112
- zoj 2104 出现次数最多的字符串 两种姿势
- HDU1004 ZOJ2104 Let the Balloon Rise【MAP+水题】
- ZOJ Problem Set–2104 Let the Balloon Rise
- ZOJ 2104 Let the Balloon Rise