紫书 抄书 UVa714

二分法确定最小的最大和minS。之后根据minS分割序列。separator[i]表示该位置上是否有" /"。为使S(1)尽量小，则S(2)尽量大;为使S(2)尽量小，则S(3)尽量da……以此类推，只需使得S(k),S(k-1),…尽量大。

#include<cmath>
#include<cstdlib>
#include<cstring>
#include<cassert>
#include<cstdio>
#include<iostream>
#include<string>
#include<numeric>
#include<algorithm>
#include<map>
#include<vector>
#include<set>
#include<sstream>
#include<fstream>
#include<queue>
#include<stack>
#include<unordered_map>
#include<tuple>
#include<deque>
#include<functional>
#include<iterator>
#include<array>
#include<list>
#include<forward_list>
#include<unordered_set>
using namespace std;
const int maxn = 1004;
typedef long long ll;
const ll INF = 50e9;
ll seq[504];
ll minS;
ll mink;
int m, k;
bool separator[504];
bool isvalid(ll s)
{
	int i = 0;
	int cnt = 0;
	while (i < m)
	{
		ll sum = 0;
		while (sum + seq[i] <= s && i < m)
		{
			sum += seq[i++];
		}
		++cnt;
		if (cnt >= k && i < m)
		{
			return false;
		}
	}
	return true;
}
void bisearch(ll low, ll high)
{
	if (low >= high)
	{
		minS = low;
		return;
	}
	ll mid = (low + high) / 2;
	if (isvalid(mid))
		bisearch(low,mid);
	else
		bisearch(mid+1,high);
}
void findSepa()//已知minS,分割序列
{
	int i = m - 1;
	while (i >= 0)
	{
		ll sum = 0;
		--k;
		while (sum + seq[i] <= minS && i >= 0)
		{
			sum += seq[i];
			if (k > i)break;
			--i;
		}
		separator[i + 1] = true;
		if (k > i)break;
	}
	while (i >= 1)
	{
		separator[i--] = true;
	}
}
int main()
{
	freopen("input.txt", "r", stdin);
	int n;
	scanf("%d", &n);
	while (n-- > 0)
	{
		scanf("%d%d", &m, &k);
		ll sum = 0;
		minS = INF;
		mink = k;
		for (int i = 0; i < m; ++i)
		{
			scanf("%lld", &seq[i]);
			sum += seq[i];
			separator[i + 1] = false;
		}
		ll average = sum / k;
		bisearch(average, sum);//寻找最小的最大和
		findSepa();
		//printf("%lld\n", minS);
		printf("%lld", seq[0]);
		for (int i = 1; i < m; ++i)
		{
			if (separator[i] == true)
			{
				printf(" /");
			}
			printf(" %lld", seq[i]);
		}
		puts("");
	}
}