CF514D R2D2 and Droid Army

知识点：二分，单调队列

难度：6

感觉这个题的难度也高了，应该是5差不多的，现在变菜了，写不出来尺取法了，这种题，尺取法加单调队列可以线性解决的，应该是最优的算法，这里采用了二分+单调队列的写法，二分答案，这个是最大化的二分，然后二分判定函数里面单调队列求固定长度的区间的最大值，也就是你想让这个区间变为小于等于0就要减去这些最大值，然后看几个最大值加起来是不是满足小于等于题目给定的次数，就完事了

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, m, k, a[N][6], b[N][6], ans[6];

bool check(int x) {
	for (int j = 1; j <= m; j++) {
		deque<int> q;
		for (int i = 1; i <= n; i++) {
			if (!q.empty() && q.front() + x == i) q.pop_front();
			while(!q.empty() && a[i][j] >= a[q.back()][j]) q.pop_back();
			q.push_back(i);
			b[i][j] = a[q.front()][j];
		}
	}
	for (int i = x; i <= n; i++) {
		int cur = 0;
		for (int j = 1; j <= m; j++) cur += b[i][j];
		if (cur <= k) {
			for (int j = 1; j <= m; j++) ans[j] = b[i][j];
			return true;
		}
	}
	return false;
}

int main() {
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			scanf("%d", &a[i][j]);
		}
	}
	int l = 0, r = n;
	while (l < r) {
		int mid = (l + r + 1) >> 1;
		if (check(mid)) l = mid;
		else r = mid - 1;
	}
	for (int i = 1; i <= m; i++) cout << ans[i] << ' ';
	return 0;
}