-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path10090.cpp
58 lines (44 loc) · 1.03 KB
/
10090.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include<iostream>
#include<cstdio>
using namespace std;
int sequence[1001010];
int tmp[1001010];
long long int cnt = 0;
void divide(int start, int end){
if(start==end-1) return;
//divide and process
int mid = (start+end)/2;
divide(start, mid);
divide(mid, end);
//comparison
int i = start, j = mid;
while(i<mid && j<end){
if(sequence[i] > sequence[j]){
cnt += end-j;
i++;
}else{
j++;
}
}
//merge
i = start, j = mid;
int tmp_idx = start;
while(i<mid && j<end){
if(sequence[i] > sequence[j]) tmp[tmp_idx++] = sequence[i++];
else tmp[tmp_idx++] = sequence[j++];
}
while(i < mid) tmp[tmp_idx++] = sequence[i++];
while(j < end) tmp[tmp_idx++] = sequence[j++];
for(int k=start; k<end; k++) sequence[k] = tmp[k];
}
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio();
int N;
cin >> N;
for(int i=0; i<N; i++){
cin >> sequence[i];
}
divide(0, N);
cout << cnt;
}