关于80pts和100pts的代码对比

#include<bits/stdc++.h>
#define int long long

const int N=1e5+1;
const int Max=1e12+1;
using namespace std;

int a[N];
int n,m;
int ans=Max,sum,maxx=-1e9;

bool killerqueen(int x)
{
	//if(x<maxx) return false;
	int tot=1;
	int b[N];
	memset(b,0,sizeof b);
	for(int i=1;i<=n;i++)
	{
		if(b[tot]+a[i]<=x) b[tot]+=a[i];
		else 
		{
			tot++;
			b[tot]=a[i];	
		}
	}
	if(tot<=m) return true;
	else return false;
}

signed main()
{
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
		sum+=a[i];
		maxx=max(maxx,a[i]);
	}
	int l=1,r=sum;
	while(l<=r)
	{
		int mid=(l+r)>>1;
		if(killerqueen(mid)==1)
		{
			ans=min(ans,mid);
			r=mid-1; 
		} else l=mid+1;
	}
	printf("%lld",ans);
	return 0;
}

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

int n,m;
int maxx=-1;
int sum; 
int a[100001];
int ans;
bool killerqueen(int ooo)
{
	int tot=0;
	int month=1;
	for(int i=1;i<=n;i++)
	{
		if(tot+a[i]<=ooo) tot+=a[i];
		else 
		{
			tot=a[i];
			month++;
		}
	}
	if(month<=m) return 1;
	else return 0;
}

int main()
{
	scanf("%d%d",&n,&m); 
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		sum+=a[i];
		maxx=max(maxx,a[i]);
	}
	int l=maxx,r=sum;
	while(l<=r)
	{
		int mid=(l+r)>>1;
		if(killerqueen(mid)==1)
		{
			ans=mid;
			r=mid-1;
		}
		else l=mid+1;
	}
	printf("%d",ans);
}