HDU 5073 Galaxy(数学)
2016-05-17 21:10
471 查看
思路:看了两个小时的题目...就是维护个平方和以及和,然后瞎搞一下就好了
Description
Good news for us: to release the financial pressure, the government started selling galaxies and we can buy them from now on! The first one who bought a galaxy was Tianming Yun and he gave it to Xin Cheng as a present.
To be fashionable, DRD also bought himself a galaxy. He named it Rho Galaxy. There are n stars in Rho Galaxy, and they have the same weight, namely one unit weight, and a negligible volume. They initially lie in a line rotating around their center of mass.
Everything runs well except one thing. DRD thinks that the galaxy rotates too slow. As we know, to increase the angular speed with the same angular momentum, we have to decrease the moment of inertia.
The moment of inertia I of a set of n stars can be calculated with the formula
where w i is the weight of star i, d i is the distance form star i to the mass of center.
As DRD’s friend, ATM, who bought M78 Galaxy, wants to help him. ATM creates some black holes and white holes so that he can transport stars in a negligible time. After transportation, the n stars will also rotate around their new center of mass. Due to financial
pressure, ATM can only transport at most k stars. Since volumes of the stars are negligible, two or more stars can be transported to the same position.
Now, you are supposed to calculate the minimum moment of inertia after transportation.
Input
The first line contains an integer T (T ≤ 10), denoting the number of the test cases.
For each test case, the first line contains two integers, n(1 ≤ n ≤ 50000) and k(0 ≤ k ≤ n), as mentioned above. The next line contains n integers representing the positions of the stars. The absolute values of positions will be no more than 50000.
Output
For each test case, output one real number in one line representing the minimum moment of inertia. Your answer will be considered correct if and only if its absolute or relative error is less than 1e-9.
Sample Input
Sample Output
#include<bits\stdc++.h> using namespace std; #define LL long long const int maxn = 50005; LL s[maxn]; /*void solve(int n,int k) { double sum = 0; for(int i = 1;i<=k;i++) sum+=s[i]; int l = 1; int r = k; for (int i = k;k<=n;k++) { double ave = sum/k,t=0; for (int j = l;j<=r;j++) t+=(s[j]-ave)*(s[j]-ave); l++; r++; sum = sum - s[l-1]+s[r]; if (i==k || ans>t) ans = t; } printf("%.10lf\n",ans); }*/ int main() { int T; scanf("%d",&T); while(T--) { int n,k; LL suml=0,sumr=0,ans=-1,t=0; scanf("%d%d",&n,&k); for(int i = 1;i<=n;i++) scanf("%lld",&s[i]); k = n-k; if(k==0 || k==1) { printf("0.000000000\n"); continue; } s[n+1]=0; sort(s+1,s+1+n); for(int i = 1;i<=k;i++) { suml = suml + s[i]; sumr = sumr + s[i]*s[i]; } for(int i = k;i<=n;i++) { t = sumr*k - suml*suml; if (i==k || ans>t) ans=t; suml = suml -s[i-k+1] +s[i+1]; sumr = sumr -s[i-k+1]*s[i-k+1]+s[i+1]*s[i+1]; } printf("%.10lf\n",(double)ans/(double)k); } }
Description
Good news for us: to release the financial pressure, the government started selling galaxies and we can buy them from now on! The first one who bought a galaxy was Tianming Yun and he gave it to Xin Cheng as a present.
To be fashionable, DRD also bought himself a galaxy. He named it Rho Galaxy. There are n stars in Rho Galaxy, and they have the same weight, namely one unit weight, and a negligible volume. They initially lie in a line rotating around their center of mass.
Everything runs well except one thing. DRD thinks that the galaxy rotates too slow. As we know, to increase the angular speed with the same angular momentum, we have to decrease the moment of inertia.
The moment of inertia I of a set of n stars can be calculated with the formula
where w i is the weight of star i, d i is the distance form star i to the mass of center.
As DRD’s friend, ATM, who bought M78 Galaxy, wants to help him. ATM creates some black holes and white holes so that he can transport stars in a negligible time. After transportation, the n stars will also rotate around their new center of mass. Due to financial
pressure, ATM can only transport at most k stars. Since volumes of the stars are negligible, two or more stars can be transported to the same position.
Now, you are supposed to calculate the minimum moment of inertia after transportation.
Input
The first line contains an integer T (T ≤ 10), denoting the number of the test cases.
For each test case, the first line contains two integers, n(1 ≤ n ≤ 50000) and k(0 ≤ k ≤ n), as mentioned above. The next line contains n integers representing the positions of the stars. The absolute values of positions will be no more than 50000.
Output
For each test case, output one real number in one line representing the minimum moment of inertia. Your answer will be considered correct if and only if its absolute or relative error is less than 1e-9.
Sample Input
2 3 2 -1 0 1 4 2 -2 -1 1 2
Sample Output
0 0.5
相关文章推荐
- 小笔记01
- Alcatraz:插件管理
- WCF服务寄宿IIS与Windows服务 - C#/.NET
- git实用说明
- 数据通信原理调制作用
- HDU 2204Eddy's爱好(容斥原理)
- 51Nod-1004-n^n的末位数字
- http post 请求数据格式选择
- 最大流-POJ-1459-Power Network
- 数据库--ORCAL--day01
- Ubuntu、Windows 、Linux集合
- Linux mysql 5.6: ERROR 1045 (28000): Access denied for user 'root'@'localhost' (usin
- C++ vector用法
- 二叉树的镜像——19
- hrbust/哈理工oj 1867 小伙伴的数据结构【树状数组】
- leetcode_ Bulls and Cows
- Codeforces Round #353 (Div. 2)C. Money Transfers
- HDU 5074 Hatsune Miku(DP)
- CodeForces 608B Hamming Distance Sum
- PAT - 肿瘤诊断 - 三维简单广搜