CodeForces - 830C Bamboo Partition（整除分块）

题目链接：点击这里

题目大意：
给定一个长度为 $n$ 的序列 {a_1,a_2,…,a_n} ，求满足 ${\sum }_{i=1}^{n}d-((a_i-1)\%d+1)\le k$ 的最大的 $d$

题目分析：
$$\sum _{i=1}^{n}d-((a_i-1)\%d+1)\le k$$
$$\sum _{i=1}^{n}d-1-((a_i-1)-d\times \lfloor \frac{a_i-1}{d}\rfloor \le k$$
$$\sum _{i=1}^{n}d-a_i+d\times \lfloor \frac{a_i-1}{d}\rfloor \le k$$
$$\sum _{i=1}^{n}d\times \lfloor \frac{a_i-1}{d}\rfloor \le k-nd+\sum _{i=1}^n{a}_i$$
$$d(\sum _{i=1}^n\lfloor \frac{a_i-1}{d}\rfloor +n)\le k+\sum _{i=1}^n{a}_i$$

有了此式子我们就可以利用整除分块来枚举 $d$ ，整个过程中 $d$ 最多有根号次可能的取值，故时间复杂度为 $O(n\sqrt{max(a_i)})$

具体细节见代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define inf 0x3f3f3f3f
#define Inf 0x3f3f3f3f3f3f3f3f
#define int ll
using namespace std;
int read()
{
	int res = 0,flag = 1;
	char ch = getchar();
	while(ch<'0' || ch>'9')
	{
		if(ch == '-') flag = -1;
		ch = getchar();
	}
	while(ch>='0' && ch<='9')
	{
		res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
		ch = getchar();
	}
	return res*flag;
}
const int maxn = 1e5+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
int n,k,a[maxn],ans,maxx; 
signed main()
{
	n = read(),k = read();
	for(int i = 1;i <= n;i++)
	{
		a[i] = read(); k += a[i]; 
		maxx = max(maxx,a[i]-1);
	}
	for(int l = 1,r,sum,tmp;l <= maxx;l = r+1)
	{
		r = inf;sum = 0;
		for(int i = 1;i <= n;i++)
			if(a[i]-1 >= l)
			{
				sum += (a[i]-1)/l;
				r = min(r,(a[i]-1)/((a[i]-1)/l));
			}
		tmp = k/(sum+n);
		if(l <= tmp) ans = max(ans,min(tmp,r));
	}
	if(maxx < k/n) ans = max(ans,k/n);
	printf("%lld\n",ans);
	return 0;
}