2013年11月7日
UVA - 11235 Frequent values
摘要： 2007/2008 ACM International Collegiate Programming ContestUniversity of Ulm Local ContestProblem F: Frequent valuesYou are given a sequence ofnintegersa1, a2, ... , anin non-decreasing order. In addition to that, you are given several queries consisting of indicesiandj(1 ≤ i ≤ j ≤ n). For each query 阅读全文
posted @ 2013-11-07 15:09 码代码的猿猿 阅读(378) 评论(0) 推荐(1)