'counting inversions' 태그의 글 목록

Counting Inversions 성공다국어 시간 제한메모리 제한제출정답맞힌 사람정답 비율 1 초 256 MB 3280 1453 1040 44.597% 문제 A permutation of integers from 1 to n is a sequence a1, a2, ..., an, such that each integer from 1 to n is appeared in the sequence exactly once. Two integers in а permutation form an inversion, when the bigger one is before the smaller one. As an example, in the permutation 4 2 7 1 5 6 3, there are 10 inver..