提出 #76967900

---

ソースコード 拡げる

#pragma GCC optimize("inline,Ofast",2)
#pragma GCC optimize("inline,Ofast",3)
#include<cstdio>
#include<iostream>
#include<cmath>
#include<string>
#include<algorithm>
#include<cstring>
#include<stack>
#include<queue>
#include<map>
#include<iomanip>
#include<vector>
#include<set>
#include<deque>
#include<ctime>
#include<cstdlib>
#include<bitset>
#include<utility>
#include<climits>
using namespace std;
#define fir first
#define sec second
#define db double
#define ld long db
#define ll long long
#define ull unsigned ll
#define ui unsigned
#define i128 __int128
#define u128 unsigned i128
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define wln(x) output(x),putchar(10)
#define wls(x) output(x),putchar(32)
char gc()
{
	char c=getchar();
	while(c==10 or c==13)c=getchar();
	return c;
}
template<class T>void read(T &x)
{
	x=0;bool f=0;
	char c=getchar();
	for(;!isdigit(c);c=getchar())f|=c==45;
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	x=f?-x:x;
}
template<class T>void output(T x)
{
	if(!x)return putchar(48),void();
	if(x<0)putchar(45),x=-x;
	int num[50]={},cnt=0;
	while(x)num[++cnt]=x%10,x/=10;
	for(int i=cnt;i;--i)putchar(48|num[i]);
}
const int N=200007;
int n,a[N];
ll ans=1LL<<60,sum[N];
signed main()
{
//	freopen("D.in","r",stdin);
//	freopen("D.out","w",stdout);
	read(n);
	for(int i=1;i<=n;++i)read(a[i]),sum[i]=sum[i-1]+a[i];
	for(int i=1;i<n;++i)
	{
		ans=min(ans,abs(sum[n]-sum[i]-sum[i]));
	}
	return output(ans),0;
}

提出情報

ジャッジ結果