Uva - 11054 - Wine trading in Gergovia
2015-06-21 15:41
369 查看
As you may know from the comic "Asterix and the Chieftain's Shield", Gergovia consists of one street, and every inhabitant of the city is a wine salesman. You wonder how this economy works? Simple enough: everyone
buys wine from other inhabitants of the city. Every day each inhabitant decides how much wine he wants to buy or sell. Interestingly, demand and supply is always the same, so that each inhabitant gets what he wants.
There is one problem, however: Transporting wine from one house to another results in work. Since all wines are equally good, the inhabitants of Gergovia don't care which persons they are doing trade with, they
are only interested in selling or buying a specific amount of wine. They are clever enough to figure out a way of trading so that the overall amount of work needed for transports is minimized.
In this problem you are asked to reconstruct the trading during one day in Gergovia. For simplicity we will assume that the houses are built along a straight line with equal distance between adjacent houses. Transporting
one bottle of wine from one house to an adjacent house results in one unit of work.
1000). If ai ≥ 0, it means that the inhabitant living in the ith house wants to buy ai bottles of wine, otherwise if ai < 0, he wants to sell -aibottles of wine. You may assume that the numbers ai sum
up to 0.
The last test case is followed by a line containing 0.
data type "long long", in JAVA the data type "long").
扫描一边就搞定了,本质和谁卖给谁没有关系,而是买多少卖多少的问题。
AC代码:
buys wine from other inhabitants of the city. Every day each inhabitant decides how much wine he wants to buy or sell. Interestingly, demand and supply is always the same, so that each inhabitant gets what he wants.
There is one problem, however: Transporting wine from one house to another results in work. Since all wines are equally good, the inhabitants of Gergovia don't care which persons they are doing trade with, they
are only interested in selling or buying a specific amount of wine. They are clever enough to figure out a way of trading so that the overall amount of work needed for transports is minimized.
In this problem you are asked to reconstruct the trading during one day in Gergovia. For simplicity we will assume that the houses are built along a straight line with equal distance between adjacent houses. Transporting
one bottle of wine from one house to an adjacent house results in one unit of work.
Input Specification
The input consists of several test cases. Each test case starts with the number of inhabitants n (2 ≤ n ≤ 100000). The following line contains n integers ai (-1000 ≤ ai ≤1000). If ai ≥ 0, it means that the inhabitant living in the ith house wants to buy ai bottles of wine, otherwise if ai < 0, he wants to sell -aibottles of wine. You may assume that the numbers ai sum
up to 0.
The last test case is followed by a line containing 0.
Output Specification
For each test case print the minimum amount of work units needed so that every inhabitant has his demand fulfilled. You may assume that this number fits into a signed 64-bit integer (in C/C++ you can use thedata type "long long", in JAVA the data type "long").
Sample Input
5 5 -4 1 -3 1 6 -1000 -1000 -1000 1000 1000 1000 0
Sample Output
9 9000
扫描一边就搞定了,本质和谁卖给谁没有关系,而是买多少卖多少的问题。
AC代码:
#include <iostream> #include <cstdio> #include <cstdlib> #include <cctype> #include <cstring> #include <string> #include <sstream> #include <vector> #include <set> #include <map> #include <algorithm> #include <stack> #include <queue> #include <bitset> #include <cassert> #include <cmath> using namespace std; int main() { ios::sync_with_stdio(false); int n; while (cin >> n && n) { long long ans = 0, a, last = 0; for (int i = 0; i < n; i++) { cin >> a; ans += abs(last); last += a; } cout << ans << endl; } return 0; }
相关文章推荐
- .pb.h:9:42: fatal error: google/protobuf/stubs/common.h: No such file or directory
- EGORefreshTableHeaderView学习
- django 简单会议室预约(1)
- OGRE1.7以上版本隐藏LOGO及鼠标拾取物体关键
- 使用 Google
- ubuntu 安装 google Gtest
- Django学习日记05_模板_模板语言
- Django学习日记04_模板_overview
- MIT algorithm 笔记(视频2)
- In machine learning, is more data always better than better algorithms?
- 返回书签 GotoBookmark
- django1.7写一个MOOC管理系统(一:基本配置)(2015.6.20)
- google host 配置
- 一千万个随机数排序,如何24秒蜕变成3秒?如何从700M内存消耗变成200M?
- First Missing Positive
- Algorithm --> 全排列
- 贪心算法(Greedy Algorithm)最小生成树 克鲁斯卡尔算法(Kruskal's algorithm)
- Google I/O 2015对于开发者的福利
- 基本语法 protocols Category extension
- Category和Extension