-
Notifications
You must be signed in to change notification settings - Fork 0
/
CODESPTB.c
87 lines (78 loc) · 1.28 KB
/
CODESPTB.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <stdio.h>
#include <stdlib.h>
long long count=0;
void merge(int arr[],int min,int mid,int max)
{
int *tmp;
tmp= (int *)malloc((max+1)*sizeof(int));
int i,j,k,m;
j=min;
m=mid+1;
for(i=min; j<=mid && m<=max ; i++)
{
if(arr[j]>arr[m])
{
tmp[i]=arr[j];
j++;
count= count+ (max-m+1);
}
else
{
tmp[i]=arr[m];
m++;
}
}
if(j>mid)
{
for(k=m; k<=max; k++)
{
tmp[i]=arr[k];
i++;
}
}
else
{
for(k=j; k<=mid; k++)
{
tmp[i]=arr[k];
i++;
}
}
for(k=min; k<=max; k++)
arr[k]=tmp[k];
free(tmp);
}
void part(int arr[],int min,int max)
{
int mid;
if(min<max)
{
mid=(min+max)/2;
part(arr,min,mid);
part(arr,mid+1,max);
merge(arr,min,mid,max);
}
}
int main() {
int test;
scanf("%d", &test);
int noe, i, j;
int *arr;
while(test--!=0) {
count=0;
scanf("%d", &noe);
arr= (int *)malloc(noe*sizeof(int));
for(i=0; i<noe; i++) {
scanf("%d", &arr[i]);
}
part(arr, 0, noe-1);
printf("%lld\n", count);
/*
int k;
for(k=0; k<noe; k++)
printf("%d ", arr[k]);
*/
free(arr);
}
return 0;
}