这题是二分,但是做的时候sb没想到怎么去二分。。。
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
using namespace std;
typedef long long ll;
const int maxn = 210;
const int MOD = 1e9+7;
const int INF = 0xFFFFFFF;
#define rep(i, x, y) for (int i=x; i<=y; i++)
#define mset(arr) memset(arr, 0, sizeof(arr))
int T, N;
int s[maxn];
int X;
/**
* 对第 i 个选手,给他 p 的观众支持率
* 最差的情况下,计算其他人能否在 (1-p) 的情况下
* 分数全部大于第 i 个选手
* 如果可以,则说明 p 过小,否则,说明 p 过大
*/
bool cal(int i, double p) {
double V = s[i] + X * p;
double sumP = 0;
for (int k = 0; k < N; ++k)
{
if(k==i) continue;
sumP += max((V-s[k])/X, 0.0);
}
return sumP <= 1.0-p;
}
int main() {
freopen("a.in", "r", stdin);
freopen("b.out", "w", stdout);
cin>>T;
for (int kase = 1; kase <= T; ++kase)
{
cin>>N;
X = 0;
for (int i = 0; i < N; ++i) {
cin>>s[i];
X += s[i];
}
printf("Case #%d: ", kase);
for (int i = 0; i < N; ++i)
{
double l = 0, r = 1, m;
while(r-l > 0.0000001) {
m = (r+l)/2;
if (cal(i, m))
l = m;
else
r = m;
}
printf("%.7lf ", m*100);
}
cout<<endl;
}
return 0;
}