Codeforces Round #143 (Div. 2) C. To Add or Not to Add 胡搞
A piece of paper contains an array of n integers a1, a2, ..., an.
Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, you
原创
2012-10-09 12:09:48 ·
1148 阅读 ·
0 评论