Loading

摘要: 题目描述 FJ's N (1 ≤ N ≤ 10,000) cows conveniently indexed 1..N are standing in a line. Each cow has a positive integer height (which is a bit of secret). 阅读全文
posted @ 2017-10-20 07:30 KVMX 阅读(235) 评论(4) 推荐(1)