2021牛客暑期多校训练营4：J-Average

题目链接

题意:给定数组$A$,$B$，矩阵$C$的元素$C(i,j)=Ai+Bj$,问$C$的所有大小大于$x\ast j$的子矩阵的平均值最大为多少

解析:在一个以$(x1,y1)$为左上角$(x2,y2)$为右下角的子矩阵$D[x1][y1][x2][y2]$中,总和为$(SUMA[x2]-SUNA[x1-1])\ast (y2-y1+1)+(SUMB[y2]-SUMB[y1-1])\ast (x2-x1+1)$,则其平均值为$\frac{(SUMA[x2]-SUNA[x1-1])}{(x2-x1+1)}$ $+$ $\frac{(SUMB[y2]-SUMB[y1-1])}{(y2-y1+1)}$,所以求一个大小大于$x\ast j$的子矩阵的最大平均值就等效于求$A$数组多于或等于$x$个连续的数的最大平均值与$B$数组多于或等于$y$个连续的数的最大平均值之和

解法:二分+前缀和，二分最大平均值,判断可不可以求得当前平均值:用一个$SUM$数组记录$Ai-aveg$之和,$rmin$记入每次询问时$sum[1$~$(i-len)]$的最小值,如果$SUM[i]-rmin>=aveg$,即存在

AcCode:

#include<iostream>
#include<algorithm>
#include<iomanip>

#define eps 0.00000001
#define inf 0x3f3f3f3f

using namespace std;

const int N = 1e5 + 100;

int arr[N];
double sum[N];

inline double min(double a, double b) { return  a < b ? a : b; }

inline bool check(int n,int len ,double ave) {
	for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + arr[i] - ave;
	double rmin = 0;
	for (int i = len; i <= n; i++) {
		if (sum[i] - rmin >= 0) {
			return true;
		}
		rmin = min(rmin, sum[i-len+1]);
	}
	return false;
}

inline double solve(int n, int x) {
	double l = 0, r = N, res = 0;
	while (r - l > eps) {
		double mid = (r + l) / 2;
		if (check(n, x, mid)) {
			res = mid;
			l = mid;
		}
		else {
			r = mid;
		}
	}
	return res;
}

signed main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	int n, m, x, y; cin >> n >> m >> x >> y;
	for (int i = 1; i <= n; i++) cin >> arr[i];
	double ans = solve(n, x);
	for (int i = 1; i <= m; i++) cin >> arr[i];
	ans += solve(m, y);
	cout << setiosflags(std::ios::fixed)<<setprecision(10)<<ans << endl;
}