算法竞赛入门经典训练指南——UVA 11300 preading the Wealth
A Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has converted all of their properties to coins of equal value, such that the total number of coins is divisible by the number of people in the village. Finally, each person gives a number of coins to the person on his right and a number coins to the person on his left, such that in the end, everyone has the same number of coins. Given the number of coins of each person, compute the minimum number of coins that must be transferred using this method so that everyone has the same number of coins.
Input
There is a number of inputs. Each input begins with n (n < 1000001), the number of people in the village. n lines follow, giving the number of coins of each person in the village, in counterclockwise order around the table. The total number of coins will fit inside an unsigned 64 bit integer.
Output
For each input, output the minimum number of coins that must be transferred on a single line.
Sample Input
3
100
100
100
4
1
2
5
4
Sample Output
0
4
算法竞赛入门经典训练指南上有题意与分析,不懂的可以去翻阅。
//Asimple #include <bits/stdc++.h> #define INF (1<<20) #define mod 10007 #define swap(a,b,t) t = a, a = b, b = t #define CLS(a, v) memset(a, v, sizeof(a)) #define debug(a) cout << #a << " = " << a <<endl using namespace std; typedef long long ll; const int maxn = 1000001; ll n, m, res, ans, len, T, k, num, sum; ll x, y; ll a[maxn], c[maxn]; /* 假设 An表示n个人原有的金币数 xn表示第n个人给n-1个人xn枚金币(x1表示1给n) M表示最终每个人拥有的金币数 则可推出通式: xn = x1-Cn 其中 Cn = A1+A2+...+An-n*M 由于要求是最小的金币数,所以x1应当取C数组的中位数 */ void input() { ios_base::sync_with_stdio(false); while( cin >> n ) { sum = 0; for(int i=1; i<=n; i++) { cin >> a[i]; sum += a[i]; } ll M = sum / n; c[0] = 0; for(int i=1; i<n; i++) c[i] = c[i-1]+a[i]-M; sort(c, c+n); ll x1 = c[n/2]; ans = 0; for(int i=0; i<n; i++) ans += abs(x1-c[i]); cout << ans << endl; } } int main(){ input(); return 0; }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列:如何用heaptrack跟踪.NET程序的非托管内存泄露
· 开发者必知的日志记录最佳实践
· SQL Server 2025 AI相关能力初探
· Linux系列:如何用 C#调用 C方法造成内存泄露
· 终于写完轮子一部分:tcp代理 了,记录一下
· 震惊!C++程序真的从main开始吗?99%的程序员都答错了
· 别再用vector<bool>了!Google高级工程师:这可能是STL最大的设计失误
· 单元测试从入门到精通
· 【硬核科普】Trae如何「偷看」你的代码?零基础破解AI编程运行原理
2016-05-10 ACM题目————Subsequence
2016-05-10 ACM题目————Aggressive cows
2016-05-10 ACM题目————列变位法解密