[二分][贪心]JZOJ 4809 挖金矿

Description

 

Input

Output

 

Sample Input

4 3
4 3 3
5 1 6
2 6 1
3 2 9

Sample Output

4.4286

 

Data Constraint

 

Hint

分析

看到平均值最小这种东西，应该容易想到二分

我们需要满足这个柿子

$\frac{\sum_{i=1}^ns[i][h[i]]}{\sum_{i=1}^nh[i]}\geq mid$

其中s[i]是前缀和，h[i]表示第i列挖多少层

那么有

$\sum_{i=1}^ns[i][h[i]-mid\times\sum_{i=1}^nh[i]\geq 0$

也就是要求每个s[i][h[i]]-mid*h[i]最大

最后判大小即可

 

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int N=1e5+10;
const double eps=1e-6;
int n,h;
vector<double> s[N];
double ans;

bool Check(double x) {
    double mx,sum=0;
    for (int i=1;i<=n;i++) {
        mx=s[i][0]-1.0*x;
        for (int j=1;j<s[i].size();j++)
            mx=max(mx,s[i][j]-1.0*(j+1)*x);
        sum+=mx;
    }
    return sum>-eps;
}

int main() {
    scanf("%d%d",&n,&h);
    for (int i=1;i<=n;i++)
        for (int j=1,a;j<=h;j++) scanf("%d",&a),s[i].push_back(j>1?s[i][s[i].size()-1]+a:a);
    double l=0.0,r=1e9;
    while (r-l>eps) {
        double mid=(l+r)/2.0;
        if (Check(mid)) ans=mid,l=mid+eps;
        else r=mid-eps;
    }
    printf("%.4lf",ans);
}

View Code

 

转载于:https://www.cnblogs.com/mastervan/p/11130129.html