AtCoder Regular Contest 078--Splitting Pile--前缀和思想

最新推荐文章于 2022-12-15 18:30:38 发布

桑榆207

最新推荐文章于 2022-12-15 18:30:38 发布

阅读量180

点赞数

分类专栏：模拟

本文链接：https://blog.csdn.net/lanshan1111/article/details/91907416

版权

模拟专栏收录该内容

146 篇文章 0 订阅

订阅专栏

C - Splitting Pile Time Limit: 2 sec / Memory Limit: 256 MB Score : points Problem Statement Snuke and Raccoon have a heap of cards. The -th card from the top has the integer 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 and , respectively. They would like to minimize . Find the minimum possible value of . Constraints is an integer. Input Input is given from Standard Input in the following format: Output Print the answer. 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, , , and thus . 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, , , and thus . 300 N i ai x y |x − y| |x − y| 2 ≤ N ≤ 2 × 10 5 −10 9 ≤ ai ≤ 10 9 ai N a1 a2 . . . aN x = 10 y = 11 |x − y| = 1 x = 10 y = −10 |x − y| = 20 D - Fennec VS. Snuke 2019/6/12 AtCoder Regular Contest 078 https://atcoder.jp/contests/arc078/tasks_print 2/5 D - Fennec VS. Snuke

#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define MAX 0x7f7f7f7f//这个地方要注意
#define maxn 200000+10
LL a[maxn];
LL sum[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    LL s=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
        s+=a[i];
        sum[i]=sum[i-1]+a[i];//---
    }
    LL minn=MAX;
    for(int i=1;i<n;i++)
    {
        minn=min(minn,abs((LL)(s-sum[i]-sum[i])));//---
    }
    printf("%lld\n",minn);
}