-
Notifications
You must be signed in to change notification settings - Fork 1
/
18870.c
72 lines (59 loc) · 1.3 KB
/
18870.c
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <stdio.h>
typedef struct X {
int value;
int id;
} X;
// mode: 1 = value, 2 = id
void merge(X a[], int l, int m, int r, int mode) {
int i, j, k;
int n1 = m-l+1;
int n2 = r-m;
X L[n1], R[n2];
for (i=0; i<n1; i++) L[i] = a[l+i];
for (j=0; j<n2; j++) R[j] = a[m+1+j];
i = 0, j = 0, k = l;
while (i < n1 && j < n2) {
if (mode == 1) {
if (L[i].value < R[j].value) a[k++] = L[i++];
else a[k++] = R[j++];
} else {
if (L[i].id < R[j].id) a[k++] = L[i++];
else a[k++] = R[j++];
}
}
while (i < n1) a[k++] = L[i++];
while (j < n2) a[k++] = R[j++];
}
// mode: 1 = value, 2 = id
void mergeSort(X a[], int l, int r, int mode) {
if (l < r) {
int m = l+(r-l)/2;
mergeSort(a, l, m, mode);
mergeSort(a, m+1, r, mode);
merge(a, l, m, r, mode);
}
}
int main(void) {
int n;
X x[1000000];
scanf("%d", &n);
for (int i=0; i<n; i++) {
scanf("%d", &x[i].value);
x[i].id = i;
}
mergeSort(x, 0, n-1, 1);
for (int i=0, idx=0, key=x[0].value; i<n; i++) {
if (x[i].value == key) {
x[i].value = idx;
} else {
key = x[i].value;
idx++;
x[i].value = idx;
}
}
mergeSort(x, 0, n-1, 2);
for (int i=0; i<n; i++) {
printf("%d ", x[i].value);
}
return 0;
}