Gergovia的酒交易(Uva11054,Wine trading in Gergovia)

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=100000+10;
int main(){
int h[maxn];
int n;
long long cost=0;
scanf("%d",&n);
while (n){
cost=0;
for(int i=1;i<=n;i++){
scanf("%d",&h[i]);
}
for (int i=1;i<=n-1;i++){
if (h[i]!=0){
h[i+1]+=h[i];
cost+=abs(h[i]);
h[i]=0;
}

}
printf ("%lld\n",cost);
scanf("%d",&n);
}
return 0;
}