Splitting Pile（AtCoder-2654）

Problem Description

Snuke and Raccoon have a heap of N cards. The i-th card from the top has the integer ai written on it.

They will share these cards. First, Snuke will take some number of cards from the top of the heap, then Raccoon will take all the remaining cards. Here, both Snuke and Raccoon have to take at least one card.

Let the sum of the integers on Snuke's cards and Raccoon's cards be x and y, respectively. They would like to minimize |x−y|. Find the minimum possible value of |x−y|.

Constraints

• 2≤N≤2×105
• −109≤ai≤109
• ai is an integer.

Input

Input is given from Standard Input in the following format:

N
a1 a2 … aN

Output

Print the answer.

Example

Sample Input 1

6
1 2 3 4 5 6

Sample Output 1

1
If Snuke takes four cards from the top, and Raccoon takes the remaining two cards, x=10, y=11, and thus |x−y|=1. This is the minimum possible value.

Sample Input 2

2
10 -10

Sample Output 2

20
Snuke can only take one card from the top, and Raccoon can only take the remaining one card. In this case, x=10, y=−10, and thus |x−y|=20.

题意：给出一个序列，将序列分成连续的两部分，每部分的值为这部分序列的数的和，求两部分的值相减的最小值

思路：首先计算总和，然后维护一个前缀和，前缀和为前半部分，每次用总和减去当前前缀和为后半部分，不断枚举比较即可

Source Program

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
const int MOD = 1E9+7;
const int N = 200000+5;
const int dx[] = {-1,1,0,0,-1,-1,1,1};
const int dy[] = {0,0,-1,1,-1,1,-1,1};
using namespace std;

LL a[N];
int main() {
    LL n;
    scanf("%lld",&n);
    LL tot=0;
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
        tot+=a[i];
    }

    LL minn=1E15;
    LL sum=a[1];
    for(int i=2;i<=n;i++){
        LL last=tot-sum;
        LL sub=last-sum;
        sub=llabs(sub);
        minn=min(minn,sub);
        sum+=a[i];
    }
    printf("%lld\n",minn);

    return 0;
}