用二分寻找最大于最小值。
二分的核心通常是寻找查找的方向即check()函数
check()函数:返回A了几道题目,A多了说明行数n取小了,否则行数n取大了。
check()函数源码:
ll check(ll x)
{
ll ans = 0, cnt = 0;
for (int i = 1; i <= n; i++) {
ans += a[i];
if (ans >= x) {
ans = 0;
cnt++;
}
else if (ans < 0) {
ans = 0;
}
}
return cnt;
}
然后就可以快乐的二分了......
样例输入:
4 2
2
5
-3
9
样例输出:
3 7
代码:
#include<iostream>
#include<string>
using namespace std;
typedef long long ll;
const ll inf = 1e18 + 7;
const int N = 1e5 + 5;
ll n, k, a[N];
ll check(ll x)
{
ll ans = 0, cnt = 0;
for (int i = 1; i <= n; i++) {
ans += a[i];
if (ans >= x) {
ans = 0;
cnt++;
}
else if (ans < 0) {
ans = 0;
}
}
return cnt;
}
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
ll L = 1, R = inf, maxu = -1, minu = -1;
while (L <= R)
{
ll mid = L + (R - L) / 2;
ll ans = check(mid);
if (k <= ans) { // 做的题太多,mid小了
if (ans == k)
maxu = mid;
L = mid + 1;
}
else {
R = mid - 1;
}
}
L = 1, R = maxu;
while (L <= R)
{
ll mid = L + (R - L) / 2;
ll ans = check(mid);
if (k >= ans) { // 做的题太少,mid大了
if (ans == k)
minu = mid;
R = mid - 1;
}
else {
L = mid + 1;
}
}
if (maxu == -1) cout << -1 << endl;
else {
cout << minu << ' ' << maxu << endl;
}
return 0;
}