J - AC自动机

P4343 [SHOI2015]自动刷题机

bisecting the left and right endpoints,验证答案,The meaning of the title is not very clear,As a result, it has not been written

#include<bits/stdc++.h>
using namespace std;

typedef long long LL;

const int N = 100010;
int a[N];
LL n,k;

int check(LL mid)
{
    
    LL res=0,sum=0;
    for(int i=1;i<=n;i++)
    {
    
        sum+=a[i];
        if(sum<0) sum=0;
        if(sum>=mid) res++,sum=0;
    }
    return res;
}
signed main()
{
    
	cin>>n>>k;
	for(int i=1;i<=n;i++) cin>>a[i];

	LL l,r;
	l=1,r=1e18;
	while(l<r)
	{
    
		LL mid=l+r>>1;
		if(check(mid)<=k) r=mid;
		else l=mid+1;
	}
	if(check(r)!=k) 
	{
    
		cout<<"-1";
		return 0;
	}
	cout<<l<<" ";
	
	l=1,r=1e18;
	while(l<r)
	{
    
		LL mid=l+r+1>>1;
		if(check(mid)>=k) l=mid;
		else r=mid-1;
	}
	cout<<l;
	
    return 0;
}