-
Notifications
You must be signed in to change notification settings - Fork 0
/
arrange.c
64 lines (53 loc) · 924 Bytes
/
arrange.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
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
typedef long long ll;
const int N = 1000010;
const ll inf = (1LL << 60);
ll in[N];
ll L[N],R[N];
long long cnt=0;
void merge(ll a[],int l,int mid,int r){
int n1=mid-l+1,n2=r-mid;
for(int i=0;i<n1;i++){
L[i]=a[l+i];
}
for(int i=0;i<n2;i++){
R[i]=a[mid+i+1];
}
L[n1]=R[n2]=inf;
int pr=0,pl=0;
for(int i=l;i<r+1;i++){
if (L[pl] <= R[pr]){
a[i]=L[pl++];
}else if (L[pl] > R[pr]){
cnt+=n1-pl;
//++cnt;
a[i]=R[pr++];
}
}
}
void mergesort(ll a[],int l,int r){
if (l < r){
int q =(r+l)/2;
mergesort(a,l,q);
mergesort(a,q+1,r);
merge(a,l,q,r);
}
}
int main()
{
int t,n;
int i;
long long int a,b;
scanf("%d",&t);
while(t--) {
scanf("%d",&n);
for(i=0;i<n;++i) {
scanf("%lld",&in[i]);
mergesort(in,0,n-1);
for(i=n-1;i>=0;i--) printf("%lld ",in[i]);
printf("\n");
}
return 0;
}