Dot Algo∙ DS/PS
2022. 2. 2.
[BOJ] 백준 10090번 Counting Inversions (Java)
#10090 Counting Inversions 난이도 : 플레 5 유형 : 세그먼트 트리 10090번: Counting Inversions 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 www.acmicpc.net ▸ 문제 A permutation of integers from 1 to n is a..
![[BOJ] 백준 10090번 Counting Inversions (Java)](http://i1.daumcdn.net/thumb/C450x300/?fname=https://blog.kakaocdn.net/dn/7YL7F/btrshy3xmSR/qKS7RrXnv5LlOXhGjnTUuk/img.png)