HDU1029----Ignatius and the Princess IV(map实现)
2015-05-15 18:28
495 查看
#include<stdio.h> #include<map> using namespace std; int main() { int n; map<int,int>mymap; while(scanf("%d",&n)!=EOF) { mymap.clear(); int ans,t; for(int i=0;i<n;i++) { scanf("%d",&t); mymap[t]++; if(mymap[t]>=(n+1)/2) ans=t; } // map<int,int>::iterator it; printf("%d\n",ans); } return 0; }
就当作是对MAP的一个简单练习,很水的一道题。
相关文章推荐
- hdu1029 Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV(DP求数列中出现次数过半的数)
- HDOJ.1029 Ignatius and the Princess IV(map)
- hdu 1029 Ignatius and the Princess IV(水题,map)
- HDU1029:Ignatius and the Princess IV -DP求一列数中出现次数最多的数的次数
- Ignatius and the Princess IV||HDU1029
- 【hdu1029 】Ignatius and the Princess IV
- 【HDU1029】B - Ignatius and the Princess IV (动态规划)
- Ignatius and the Princess IV---hdu1029(动态规划或者sort)
- HDU1029-Ignatius and the Princess IV
- E - Let the Balloon Rise ,Y - Ignatius and the Princess IV (map的应用)
- HDU1029:Ignatius and the Princess IV(找出数组中出现次数超过一半的数字)
- Ignatius and the Princess IV(map)
- hdu 1029 Ignatius and the Princess IV //map的使用
- HDU1029 Ignatius and the Princess IV
- hdu1029 B - Ignatius and the Princess IV
- HDU1029:Ignatius and the Princess IV
- hdu1029 Ignatius and the Princess IV 水题
- HDU 1029 Ignatius and the Princess IV 水题
- hdu 1029 Ignatius and the Princess IV