ZOJ 2104 Let the Ballon Rise(map解法)
2015-02-03 22:00
357 查看
题意很简单,就是统计给定字符串序列中出现 最多的串。利用map特性很容易解决问题,对于一些思路比较奇特的题,stl的容器还是比较不错的选择!
代码:
代码:
#include <iostream> #include <string> #include <map> using namespace std; int main() { int n; while(cin>>n&&n) { map <string,int> cnt; string s,maxstring; int maximum=0; for(int i=0;i<n;i++) { cin>>s; cnt[s]++; if(cnt[s]>maximum) { maximum=cnt[s]; maxstring=s; } } cout<<maxstring<<endl; } return 0; }
相关文章推荐
- zoj 2104 Let the Balloon Rise(map映照容器的应用)
- ZOJ 2104/HDU 1004 Let the Balloon Rise(map容器)
- ZOJ 2104 Let the Balloon Rise
- Let the Balloon Rise HDU - 1004 (用map,vector的解法)
- ZOJ 2104 Let the Balloon Rise
- ZOJ2104 Let the Balloon Rise
- ZOJ 2104 Let the Balloon Rise
- zoj 2104 Let the Balloon Rise
- zoj 2104 Let the Balloon Rise
- ZOJ Problem Set–2104 Let the Balloon Rise
- 2104:Let the Balloon Rise——map容器
- ZOJ_2104_Let the Balloon Rise
- ZOJ2104——Let the Balloon Rise
- ZOj 2104——Let the Balloon Rise
- zoj 2104 Let the Balloon Rise
- ZOJ_2104_Let the Balloon Rise
- HDU1004 ZOJ2104 Let the Balloon Rise【MAP+水题】
- zoj 2104.Let the Balloon Rise
- 2104_Let the Balloon Rise
- HDU 1004 Let The Balloon Rise (简单map)