-
Notifications
You must be signed in to change notification settings - Fork 12
/
Day-7_Spearman'sRankCorrelationCoefficient.cpp
83 lines (57 loc) · 1.31 KB
/
Day-7_Spearman'sRankCorrelationCoefficient.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
/*
rank = 1 - (6*summation(x[i]-y[i])^2)/n*(n^2-1);
*/
vector<double> build_rank(double x[], int n)
{
map<double, int> m1;
vector<double> x1(n);
for(auto i=0; i<n; i++)
{
m1.insert(make_pair(x[i], i));
}
int rank = 0;
for(auto it : m1)
{
x1[it.second] = rank++;
}
return x1;
}
double supermans_rank(double x[], double y[], int n)
{
double num = 0;
auto rank_x = build_rank(x, n);
auto rank_y = build_rank(y, n);
for(auto i=0; i<n; i++)
{
num += ((rank_x[i]-rank_y[i])*(rank_x[i]-rank_y[i]));
}
num *= 6.0;
double den = (n*(n*n - 1));
double res = num/den;
res = 1 - res;
return res;
}
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int n; cin>>n; double x[n+4], y[n+4];
for(auto i=0; i<n; i++)
{
cin>>x[i];
//sum1 += x[i];
}
for(auto i=0; i<n; i++)
{
cin>>y[i];
//sum3 += y[i];
}
double supermans_rank_coeff = supermans_rank(x, y, n);
printf("%0.3f", supermans_rank_coeff);
return 0;
}