2940.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 37 行

Problem Id:2940  User Id:fzk 
Memory:48K  Time:46MS
Language:C++  Result:Accepted

Source 

#include <algorithm>
#include <cstdio>
#include <string.h>
#include <map>
#include <stack>
#include <memory.h>
#include <math.h>
#include <queue>
using namespace std;


int main( ){
	int n, i, s;
	__int64 sum, need;
	while( 1 ) {
		scanf( "%d", &n );
		if( n == 0 )
			break;
		sum = 0, need = 0;
		for( i=0; i<n; i++ ) {
			scanf( "%d", &s );
			sum += abs(need);
			need += s;
		}
		printf( "%I64d\n", sum );
	}
	return 0;
}