题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=5645
思路:简单模拟
AC代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long ll;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
int a[310],b[310];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);//要注意这个啊
int sum1 = n * (n-1);
int sum = 0;
for(int i=1; i<=n; i++)
{
for(int j=i+1; j<=n; j++)
{
if(a[j] > a[i])
sum++;
}
}
if(sum1 == 0)
{
printf("0.000000\n");
}
else
printf("%.6lf\n",(double)sum/(double)sum1);
}
return 0;
}