摘要:
Sample Input Sample Output You are given a {1, 2, ..., n}-permutation a[1], a[2], ..., a[n]. How many pairs of integers (i, j) satisfy 1 ≤ i ≤ j ≤ n a 阅读全文
posted @ 2019-01-04 19:22
nimphy
阅读(402)
评论(0)
推荐(0)
摘要:
Sample Input Sample Output Prof.Q is a sophisticated professor who has insights into quadrillions of sorting algorithms, especially into bubble sort. 阅读全文
posted @ 2019-01-04 18:38
nimphy
阅读(728)
评论(0)
推荐(0)

浙公网安备 33010602011771号