o_OzZZ的博客

Long long ago, there was an integer sequence a. Tonyfang think this sequence is messy, so he will count the number of inversions in this sequence. Because he is angry, you will have to pay x yuan for...

FansblogProblem DescriptionFarmer John keeps a website called ‘FansBlog’ .Everyday , there are many people visited this blog.One day, he ...

题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=6693对于0.5以下的概率x的贡献值最多只有到1/x个。在有效的贡献范围内只要他的个数还没到就一直是有用的，直接计算就好了。#include<bits/stdc++.h>using namespace std;double num[100000+10];d...