摘要: 题目描述 对于给定一个整数序列,你的任务是确定这个序列中出现次数最多的整数和它出现的次数。输入输入包含多组测试数据,每组数据的第一行为一个整数N(0 2 struct vode 3 { 4 int date; 5 int cs; 6 }f[10000],t; 7 int main() 8 { 9 int i,n,j;10 while(~scanf("%d",&n))11 {12 for(i=1;i=1;i--)17 {18 for(j=1;jf[j].date)25 {26 t=f[i... 阅读全文
posted @ 2013-07-31 16:13 狂盗一枝梅 阅读(980) 评论(0) 推荐(0) 编辑
摘要: Message FloodTime Limit: 1500MS Memory limit: 65536K题目描述Well, how do you feel about mobile phone? Your answer would probably be something like that "It's so convenient and benefits people a lot". However, If you ask Merlin this question on the New Year's Eve, he will definitely ans 阅读全文
posted @ 2013-07-31 16:08 狂盗一枝梅 阅读(281) 评论(0) 推荐(0) 编辑