Educational Codeforces Round 3 C.Load Balancing(模拟)
2016-01-20 13:20
369 查看
Educational Codeforces Round 3C:http://codeforces.com/contest/609/problem/C
C. Load Balancing
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
output
input
output
input
output
Note
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.
题目大意:1~n个服务器,每个服务器的任务量为m[i],移动一个任务需要1秒,要求max(m[i])-min([m[j]]最小,求所需最小时间
大致思路:每个服务器平分任务量,不够平分的按次序给每个服务器多一个任务即可
刚开始直接模拟,总WA,最后看到大家都是算出所需移动的任务的二倍,这样简单多了
C. Load Balancing
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
2 1 6
output
2
input
7 10 11 10 11 10 11 11
output
0
input
5 1 2 3 4 5
output
3
Note
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.
题目大意:1~n个服务器,每个服务器的任务量为m[i],移动一个任务需要1秒,要求max(m[i])-min([m[j]]最小,求所需最小时间
大致思路:每个服务器平分任务量,不够平分的按次序给每个服务器多一个任务即可
刚开始直接模拟,总WA,最后看到大家都是算出所需移动的任务的二倍,这样简单多了
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; int n,m[100005],i,j,sum,num,mx,mn,tmp; long long ans; int main() { scanf("%d",&n); sum=ans=0; for(i=0;i<n;++i) { scanf("%d",m+i); sum+=m[i]; } mx=mn=sum/n; if(num=sum%n) ++mx; sort(m,m+n); num=n-num; for(i=0;i<num;++i) ans+=abs(mn-m[i]); for(;i<n;++i) ans+=abs(m[i]-mx); printf("%I64d\n",ans>>1); return 0; }
相关文章推荐
- iOS 学习框架图
- 移动端省际联动插件mobiscroll
- sencha touch list 批量选择扩展
- 下次有人不会配unity 安卓环境,就让他看看这个吧
- android使用notifyDataSetChanged()方法更新数据失效,adapter的数据更新了,但是ListView的内容没有更新;
- Debian 入门安装与配置2
- 国内首家苹果iBeacon系统“水滴”启动商用
- Linux曲径通幽:常用命令(文件处理命令)
- CPU纯软件半虚拟化技术
- How Do iBeacons Work
- 一个数学问题
- Tomcat配置
- 一次面试总结
- 盘点图灵30篇最受欢迎微信文章
- Google的Objective-C编码规范(代码规范很重要,规范的代码很有美感。)
- Android Studio 添加AndroidAnnotations
- Gradle学习基础(2):构建简单的JAVA项目
- HDU1040As Easy As A+B
- js字符串 js 数组转换 网上的找的例子
- React Native-3.React Native中的主要布局属性介绍和练习