CodeForces 609C Load Balancing
来源:互联网 发布:htc手机数据连接不上 编辑:程序博客网 时间:2024/06/07 13:19
Description
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 are mi tasks assigned to the i-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 expression ma - mb, where a 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.
Input
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 the i-th server.
Output
Print the minimum number of seconds required to balance the load.
Sample Input
21 6
2
710 11 10 11 10 11 11
0
51 2 3 4 5
3
Hint
In the first example two seconds are needed. In each second, a single task from server #2 should be moved to server #1. After two seconds there should be 3 tasks on server #1 and 4 tasks on server #2.
In the second example the load is already balanced.
A possible sequence of task movements for the third example is:
- move a task from server #4 to server #1 (the sequence m becomes: 2 2 3 3 5);
- then move task from server #5 to server #1 (the sequence m becomes: 3 2 3 3 4);
- then move task from server #5 to server #2 (the sequence m becomes: 3 3 3 3 3).
The above sequence is one of several possible ways to balance the load of servers in three seconds.
题意比较好理解
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int n,i,j,k,l,avg1,avg2,a[110000];int main(){while(scanf("%d",&n)!=EOF){int sum=0;for(i=0;i<n;i++){scanf("%d",&a[i]);sum+=a[i];}avg1=avg2=sum/n;if(sum%n)avg2++;int num1=0;int num2=0;for(i=0;i<n;i++){if(a[i]<avg1){num1+=(avg1-a[i]);}else if(a[i]>avg2){num2+=(a[i]-avg2);}}int num=max(num1,num2);printf("%d\n",num);}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(模拟)
- CodeForces 609CLoad Balancing
- Load Balancing
- load balancing
- 371. Sum of Two Integers
- 关于分块算法and莫队算法
- java中特殊的流程控制语句(break,continue,return)
- 开发者MAC电脑里的十八般兵器
- Android通知栏
- CodeForces 609C Load Balancing
- SDUT 2133 数据结构实验之栈三:后缀式求值
- JZOJ1444. 交换【推荐】
- python学习——TCP编程
- 杭电ACM--HDU-1021斐波拉契
- CocosCreator
- Spark学习(3)--Scala语言学习
- Leetcode 319 : Bulb Switcher
- 计蒜客 挑战难题 跳跃游戏