UVA-11054(扫描法)

#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));

typedef  long long LL;

template<class T> void read(T&num) {
    char CH; bool F=false;
    for(CH=getchar();CH<‘0‘||CH>‘9‘;F= CH==‘-‘,CH=getchar());
    for(num=0;CH>=‘0‘&&CH<=‘9‘;num=num*10+CH-‘0‘,CH=getchar());
    F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {
    if(!p) { puts("0"); return; }
    while(p) stk[++ tp] = p%10, p/=10;
    while(tp) putchar(stk[tp--] + ‘0‘);
    putchar(‘\n‘);
}

const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=1e9;
const int N=12e4+10;
const int maxn=1e3+10;
const double eps=1e-10;

int n,a[N]; 

int main()
{
        while(1)
        {
            read(n);
            if(!n)break;
            For(i,1,n)read(a[i]);
            LL ans=0;
            For(i,1,n)
            {
                ans=ans+abs(a[i]);
                a[i+1]=a[i+1]+a[i];
            }
            cout<<ans<<endl;
        }
        
        return 0;
}