UVA 11054 - Wine trading in Gergovia
2012-02-01 17:45
253 查看
因为最终都会满足每个人的要求。所以我们可以当作每个居民与他的邻居进行交易,将每次的交易额计算出来相加即可。
#include<cstdio> #include<cstdlib> #define MAXN 100010 int a[MAXN]; long long min, w; int n; int main() { while( scanf( "%d", &n), n) { for( int i = 0; i < n; i ++) scanf( "%d", &a[i]); min = w = 0; for( int i = 0; i < n; i ++) { min += abs( w); w += a[i]; } printf( "%lld\n", min); } return 0; }
相关文章推荐
- Uva - 11054 - Wine trading in Gergovia
- Wine trading in Gergovia UVA - 11054
- UVA 11054 Wine trading in Gergovia
- Cpp环境 【poj 2940 】【Uva11054】【Vijos2909】Wine Trading in Gergovia 格尔高维亚的肮脏红酒交易
- [问题分解]UVa11054 - Wine trading in Gergovia
- uva 11054 Wine trading in Gergovia
- Uva - 11054 - Wine trading in Gergovia
- UVa 11054/HDU 1489/POJ 2940 Wine trading in Gergovia(贪心&双向队列)
- UVA11054:Wine trading in Gergovia(Gergovia的酒交易)
- UVa 11054 - Wine trading in Gergovia
- UVA 11054 Wine trading in Gergovia
- [等价转换]UVa11054 - Wine trading in Gergovia
- UVA 11054 Wine trading in Gergovia 葡萄酒交易 贪心+模拟
- UVA 11054 Wine trading in Gergovia
- UVa 11054 - Wine trading in Gergovia
- [贪心]UVA11054 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