a = 0
while max(V) > 0:
C = [ 0 ] * max(V)
for x in V:
if x%2==0:
a += C[x//2]
else:
C[x//2] += 1
V = [ x//2 for x in V ]
print(a)
# | User | Rating |
---|---|---|
1 | Benq | 3813 |
2 | tourist | 3768 |
3 | maroonrk | 3570 |
4 | Radewoosh | 3535 |
5 | fantasy | 3526 |
6 | jiangly | 3523 |
7 | Um_nik | 3522 |
8 | orzdevinwang | 3441 |
9 | cnnfls_csy | 3427 |
10 | zh0ukangyang | 3423 |
# | User | Contrib. |
---|---|---|
1 | awoo | 180 |
2 | -is-this-fft- | 178 |
3 | nor | 169 |
4 | Um_nik | 168 |
5 | SecondThread | 164 |
6 | maroonrk | 163 |
7 | adamant | 162 |
8 | kostka | 161 |
9 | YouKn0wWho | 158 |
10 | antontrygubO_o | 154 |
How does Counting Inversions work in the following code?
a = 0
while max(V) > 0:
C = [ 0 ] * max(V)
for x in V:
if x%2==0:
a += C[x//2]
else:
C[x//2] += 1
V = [ x//2 for x in V ]
print(a)
Name |
---|