uva 11054 wine trading in gergovia (归纳【好吧这是我自己起的名字】)——yhx
来源:互联网 发布:soap报文转换成json 编辑:程序博客网 时间:2024/05/01 22:09
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 specic amount of wine. They are clever enough
to gure 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
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 (
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 specic amount of wine. They are clever enough
to gure 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
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 (
0 0
- uva 11054 wine trading in gergovia (归纳【好吧这是我自己起的名字】)——yhx
- uva 11054 wine trading in gergovia (归纳【好吧这是我自己起的名字】)——yhx
- uva 11054——Wine trading in Gergovia
- UVa 11054 Wine trading in Gergovia——思路题
- 例题8-5 Gergovia的酒交易(Wine trading in Gergovia, UVa 11054)
- UVa 11054 - Wine trading in Gergovia
- UVa 11054 - Wine trading in Gergovia
- uva 11054 - Wine trading in Gergovia
- uva 11054 - Wine trading in Gergovia
- UVA 11054 - Wine trading in Gergovia
- UVA 11054 Wine trading in Gergovia
- uva 11054 - Wine trading in Gergovia
- uva 11054 Wine trading in Gergovia
- UVa:11054 Wine trading in Gergovia
- uva 11054 Wine trading in Gergovia
- UVa 11054 - Wine trading in Gergovia
- UVA - 11054 Wine trading in Gergovia
- uva--11054Wine trading in Gergovia +贪心
- NOIP2008 普及组T2 排座椅 解题报告-S.B.S
- POJ1466 Girls and Boys
- NOIP2008提高组火柴棒等式(模拟)——yhx
- uva 11134 fabled rooks (贪心)——yhx
- NOIP2008提高组(前三题) -SilverN
- uva 11054 wine trading in gergovia (归纳【好吧这是我自己起的名字】)——yhx
- uva 1606 amphiphilic carbon molecules【把缩写写出来,有惊喜】(滑动窗口)——yhx
- noip2014提高组day2二题题解-rLq
- NOIP2008 T3 传纸条 解题报告——S.B.S.
- git学习记录--merge
- NOIP2009普及组细胞分裂(数论)——yhx
- uva 11572 unique snowflakes——yhx
- uva 1471 defence lines——yhx
- NOIP2010提高组 关押罪犯 -SilverN