Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 123800    Accepted Submission(s): 48826 Problem Description Contest time again! How excited it is to see balloons floating ar…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1004 Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 90644    Accepted Submission(s): 34459 Problem Description Contest time a…

传送门: http://acm.hdu.edu.cn/showproblem.php?pid=1004 Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 143275    Accepted Submission(s): 56670 Problem Description Contest time…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1004 用STL 中的 Map 写的 #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <string> #include <map> using namespace std; map<string, int>…

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 74110    Accepted Submission(s): 27711 Problem Description Contest time again! How excited it is to see balloons floating aro…

ps:很简单的一个字符串处理问题.. 代码: #include "stdio.h" #include "string.h" int find(int flag[],int k); int main(){ ][],num[][]; ],t; ){ k=; memset(flag,,sizeof(flag)); ;i<T;i++){ scanf("%s",&ss[i]); ){ strcpy(num[k],ss[i]); flag[k]…

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 104108    Accepted Submission(s): 40046 Problem Description Contest time again! How excited it is to see balloons floating ar…

#include <stdio.h> #include <string.h> ][]; ]={}; int main() { int n,i,j,k,max,loc; ){ max=-; k=; loc=; ;i<n;i++){ scanf("%s",a[k]); ;j<k;j++){ ){ b[j]++; k--; break; } } k++; } ;i<k;i++){ if(b[i]>max){ max=b[i]; loc=i; }…

题意:输出颜色最多的那个颜色. 思路:水题一道. #include <iostream> #include <string> #include <map> #include <cstring> using namespace std; int main() { int n ;map<string ,int > boll ; while(cin >> n) { ) break ; string str,s ; boll.clear()…

Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color…