紫书 Gergovia的酒交易 UVa 11054

最新推荐文章于 2025-06-06 21:48:36 发布

进击的程序

最新推荐文章于 2025-06-06 21:48:36 发布

阅读量123

点赞数 1

分类专栏：算法入门紫文章标签：算法

本文链接：https://blog.youkuaiyun.com/weixin_46273288/article/details/115426800

版权

算法入门紫专栏收录该内容

100 篇文章

订阅专栏

在这里插入图片描述

#include<iostream>
#include<string>
#include<cassert>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<set>
#include<sstream>
#include<queue>
#include<unordered_map>
using namespace std;
const int maxn = 100000 + 10;
int wine[maxn];
int main() {
    //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout);
    int n;
    while (cin >> n && n)
    {
        long long labor = 0;
        
        for (int i = 0; i < n; ++i)
        {
            cin >> wine[i];
        }
        long long wineleft = wine[0];
        for (int i = 1; i < n; ++i)
        {
            labor += abs(wineleft);
            wineleft += wine[i];
        }
        cout << labor << endl;
    }
}