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)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | Benq | 3783 |
3 | Radewoosh | 3602 |
4 | Um_nik | 3541 |
5 | fantasy | 3526 |
6 | maroonrk | 3504 |
7 | ko_osaga | 3500 |
8 | jiangly | 3465 |
9 | orzdevinwang | 3460 |
10 | cnnfls_csy | 3427 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 180 |
2 | -is-this-fft- | 177 |
3 | nor | 169 |
4 | Um_nik | 168 |
5 | SecondThread | 164 |
6 | maroonrk | 163 |
7 | adamant | 161 |
8 | kostka | 160 |
9 | YouKn0wWho | 158 |
10 | tourist | 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)
Название |
---|