CodeForces 609C-C. Load Balancing
来源:互联网 发布:cms 系统 小程序 编辑:程序博客网 时间:2024/05/20 16:33
In the school computer room there are n servers which are responsible for processing several computing tasks. You know the number of scheduled tasks for each server: there aremi tasks assigned to thei-th server.
In order to balance the load for each server, you want to reassign some tasks to make the difference between the most loaded server and the least loaded server as small as possible. In other words you want to minimize expressionma - mb, wherea is the most loaded server and b is the least loaded one.
In one second you can reassign a single task. Thus in one second you can choose any pair of servers and move a single task from one server to another.
Write a program to find the minimum number of seconds needed to balance the load of servers.
The first line contains positive number n (1 ≤ n ≤ 105) — the number of the servers.
The second line contains the sequence of non-negative integers m1, m2, ..., mn (0 ≤ mi ≤ 2·104), where mi is the number of tasks assigned to thei-th server.
Print the minimum number of seconds required to balance the load.
21 6
2
710 11 10 11 10 11 11
0
51 2 3 4 5
3
解题思路:
这里给出一串数字,要将他调整成为平衡的数组,就是左右差不超过一,每次可以任选两个元素使得其中一个减1,另一个加1,付出代价为1。问你最小的代价使得序列最平衡。先计算出平衡时的上限和下限,显然小于下限的我们要提到Min,大于上限的我们要降到Max,而每次升和降是可以用代价1实现的。这样统计两边的代价,取最大值就好了。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int map[10000000];int Max(int x,int y){return max(x,y);}int main(){int n;while(scanf("%d",&n)!=EOF){int sum=0;int i,j;for(i=0;i<n;i++){scanf("%d",&map[i]);sum+=map[i];}int max,min;max=min=sum/n;if(sum%n)max++;int ans1=0,ans2=0;for(i=0;i<n;i++){if(map[i]<min){ans1+=min-map[i];}else if(map[i]>max){ans2+=map[i]-max;}}printf("%d\n",Max(ans1,ans2));}return 0;}
- Codeforces 609C Load Balancing
- CodeForces 609C Load Balancing
- CodeForces 609C Load Balancing
- Codeforces 609C Load Balancing
- CodeForces 609C Load Balancing
- CodeForces 609C-C. Load Balancing
- Codeforces 609C Load Balancing 【水题】
- CodeForces--609C --Load Balancing(水题)
- 【CodeForces】609C - Load Balancing(水)
- CodeForces 609 C. Load Balancing(水~)
- Educational Codeforces Round 3 609C Load Balancing(脑洞)
- codeforces 603 C. Load Balancing 贪心
- Educational Codeforces Round 3 C. Load Balancing
- Codeforces Educational Codeforces Round 3 C. Load Balancing(贪心)
- Educational Codeforces Round 3 C.Load Balancing(模拟)
- 【Educational Codeforces Round 3 C】【贪心 排序】Load Balancing 最小操作步数使得数字之差尽可能小
- CodeForces 609CLoad Balancing
- Load Balancing
- 算法设计题3.25-栈和队列-第3章-《数据结构习题集》-严蔚敏吴伟民版
- 算法设计题3.26-栈和队列-第3章-《数据结构习题集》-严蔚敏吴伟民版
- poj2488A Knight's Journey--简单搜索
- nodesj中 中间件express-session的理解
- 算法设计题3.30 && 3.32-栈和队列-第3章-《数据结构习题集》-严蔚敏吴伟民版
- CodeForces 609C-C. Load Balancing
- 新版Cordova(>4.0)编译Android APK打上签名方法
- foreach循环中删除一个列表中的元素报错
- 将Android开源项目通过Gradle发布到bintray/Jcenter
- PHP连接MySQL数据库;mysql中update批量修改与替换语句
- Dreamweaver8自动关闭问题
- linux命令积累
- Android中取消标题栏遇到的问题
- [从头学数学] 第41节 万以内的加法和减法(二)