Description
Solution
可以二分答案,再把每个数减去二分出来的值,看看每列的最大前缀值加起来是否大于0即可。
复杂度: O(log(109)∗hn)
Code
#include<cstdio>
#include<cstdlib>
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef double db;
const int N=100500;
long long read(long long &n)
{
int q=0,w=1;n=0;
char ch;
for(ch=getchar();(ch<'0'||ch>'9')&&ch!='-';ch=getchar());
if(ch=='-')ch=getchar(),w=-1;
for(;ch<='9'&&ch>='0';ch=getchar())q=q*10+ch-48;
return n=w*q;
}
long long n,m,ans;
long long a[N];
db l,r;
long double ANS;
long long max(long long q,long long w){return q<w?w:q;}
db OK(db q)
{
db ans=0,t,w;ANS=0;int e,E=0;
fo(i,1,n)
{
t=-1e9,w=0;
fo(j,1,m)
{
w=a[i*m-m+j]-q*j;
if(t<w)t=w,e=j;
}
ans+=t;
// ANS+=a[i*m-m+e];E+=e;
}
ANS/=1.0*E;
return ans;
}
int main()
{
int q,w;l=1;
read(n),read(m);
fo(i,1,n)
{
r=max(r,read(a[i*m-m+1]));
fo(j,2,m)r=max(r,a[i*m-m+j]=read(a[i*m-m+j])+a[i*m-m+j-1]);
}
while(r-l>=0.000005)
{
db t=(l+r)*0.5;
if(OK(t)>=1e-6)l=t;
else r=t;
}
printf("%.4lf\n",l);
return 0;
}