>Link
ybtoj数列分段
>解题思路
一道典型的二分答案
时间复杂度大概为
O
(
30
N
)
O(30N)
O(30N)
>代码
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 100010
using namespace std;
int n, m, a[N], l, r, mid, ans;
bool check (int x)
{
int cnt = 1, sum = a[1];
for (int i = 2; i <= n; i++)
if (sum + a[i] > x) cnt++, sum = a[i];
else sum += a[i];
if (cnt <= m) return 1;
return 0;
}
int main()
{
scanf ("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
{
scanf ("%d", &a[i]);
l = max (l, a[i]), r += a[i];
}
ans = r;
while (l <= r)
{
mid = (l + r + 1) / 2;
if (check (mid)) ans = min (ans, mid), r = mid - 1;
else l = mid + 1;
}
printf ("%d", ans);
return 0;
}