题目: https://uva.onlinejudge.org/external/110/11054.pdf
题目思想挺纯粹的,就是等价转换法
#include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long LL;
int main(){
int n;
while (~scanf("%d",&n)&&n) {
long long ans = 0, a, last = 0;
for(int i=0;i<n;i++){
scanf("%lld",&a);
ans+=abs(last);
last+=a;
}
cout<<ans<<endl;
}
return 0;
}