HEU 5016 Exchange Apples

 1/**//**************************************
 2Problem: HEU 5016 Exchange Apples
 3Time: 0.0100 s
 4Memory: 248 k 
 5Accepted Time: 2009-03-30 17:11:56
 6Tips: 满足第一个元素，只能从第二个元素里得到满足,以此类推 
 7**************************************/
 8#include <stdio.h>
 9#define abs(x) (x>0?x:-x)
int main()
{
    int tt,n,i,j,k,a[100009];
    scanf("%d",&tt);
    while(tt--)
    {
        int sum=0;
        scanf("%d",&n);
        for(i=0;i<n;i++)scanf("%d",&a[i]);
        for(i=0;i<n-1;i++)
        {
            sum+=abs(a[i]);
            a[i+1]+=a[i];
        }
        printf("%d\n",sum);     
    }     
    return 0;
}