uva 11054 wine trading in gergovia (归纳【好吧这是我自己起的名字】)——yhx
2016-05-02 16:44
453 查看
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 (
相关文章推荐
- uva 11054 wine trading in gergovia (归纳【好吧这是我自己起的名字】)——yhx
- UVa 11292 Dragon of Loowater
- UVa 11292 Dragon of Loowater
- 关于google搜索
- Where my books go ——by William Butler Yeats
- Golang 学习笔记 ---类型和一个 HelloWorld
- 关于音频文件处理工具GoldWave的简单使用教程:裁剪、降低音质等
- MFC笔记----改变logo图标
- setup django 4 test
- DragonBoard 410c手把手进行安卓开发之底层移植
- 机器学习系列(8)_读《Nature》论文,看AlphaGo养成
- Mapreduce Patterns, Algorithms, and use cases
- django快速搭建简单blog
- django1.8读书笔记模型高级进阶
- Google机器学习教程心得(二)决策树与可视化
- Google机器学习教程心得(二)决策树与可视化
- Ubuntu上用mod_wsgi部署Django出现的一些问题
- Django 的 CSRF 保护机制
- Google Code Jam 2016 Round 1B Problem C. Technobabble
- 彻底消除wine中文乱码,QQ,kugoo等等....