解题报告

撰写人： 许苡键

难度等级

★★☆☆☆

参考程序

#include <bits/stdc++.h>
using namespace std;
int main(){
	long long n,m;
	cin>>n;
	long long a[n+1],b[n+1],d=99999;
	b[0]=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		b[i]=b[i-1]+a[i];
	}
	for(int i=1;i<=n;i++){
		if(max(b[i],b[n]-b[i])-min(b[i],b[n]-b[i])<d){
			d=max(b[i],b[n]-b[i])-min(b[i],b[n]-b[i]);
		}
	}
	cout<<d;
}

C++ :

#include<bits/stdc++.h>
using namespace std;
long long n,a[100005],b[100005],minx=10000000000000001;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		b[i]=b[i-1]+a[i];
	}
	for(int i=1;i<=n;i++)
	{
		if(max(b[i],b[n]-b[i])-min(b[i],b[n]-b[i])<minx){minx=max(b[i],b[n]-b[i])-min(b[i],b[n]-b[i]);
		}
	}
	cout<<minx;
	return 0;
}