题面很玄学,要是我也有这么一台机器就好了QAQ
如果知道了一题几行,判断合不合法应该是很简单的,就是一个简单的模拟QAQ
long long check(long long middle/*传进来的值,就是一题几行*/)
{
long long i,sum=0,pd=0;
for(i=1;i<=l;i++)
{
sum+=a[i];
if(sum>=middle){pd++;sum=0;}//刷了一题
sum=MAX(sum,0);//党sum<0时要为0
}
//如果刷的题数和要求一样就返回true
return k==pd;
}
然后只要套上两个二分QAQ
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<string.h>
#include<algorithm>
#define INF 0x7f7f7f7f7f7f7f//最大值要稍微定大一点,感觉在OJ上提交几百亿行代码好玄学QAQ
using namespace std;
long long MAX(long long a,long long b)
{
if(a>b)return a;else return b;
}
long long i,j,k,l;
long long a[200000];
long long check(long long middle)
{
long long i,sum=0,pd=0;
for(i=1;i<=l;i++)
{
sum+=a[i];
if(sum>=middle){pd++;sum=0;}
sum=MAX(sum,0);
}
return pd;//返回刷的题数比较方便判断
}
long long Logn_max(long long left,long long right)//二分最大值
{
long long middle,answer=-1,Check;
while(right>=left)
{
middle=(left+right)/2;
Check=check(middle);
if(Check>k){left=middle+1;}else {right=middle-1;if(Check==k)answer=middle;/*这里要注意,必须要是等于k才能更新ans,下同*/}
}
return answer;
}
long long Logn_min(long long left,long long right)//二分最小值
{
long long middle,answer=-1,Check;
while(right>=left)
{
middle=(left+right)/2;
Check=check(middle);
if(Check>=k/*注意这里和最小值是不一样的QAQ*/){left=middle+1;if(Check==k)answer=middle;}else right=middle-1;
}
return answer;
}
int main()
{
cin>>l>>k;
for(i=1;i<=l;i++)
cin>>a[i];
long long Max=Logn_max(1,INF),Min=Logn_min(1,INF);//二分一下ans
if(Min!=-1/*如果没有解就输出-1*/)cout<<Max<<" "<<Min;/*有解就输出解*/else cout<<-1;
return 0;
}