电梯调度

public class Elevator {
private static int totalFloorNum = 10;
private static int totalStopNum = 4;
private static int[] person = new int[totalFloorNum];
private static int[][] floorIndex = new int[totalFloorNum][totalStopNum];

private static int computePeopleStairs(int floor, int stopNum) {
int max = totalFloorNum - stopNum;

if (stopNum == 0) {
int temp = 0;
for (int i = floor + 1; i < max; i++) {
temp += person[i] * (i - floor);
}
return temp;
} else {
int minPersonStair = Integer.MAX_VALUE;
for (int i = floor + 1; i <= max; i++) {
int temp = 0;
int mid = (floor + i) / 2;

if (floor == 0) {
for (int j = 1; j < i; j++) {
temp += (i - j) * person[j];
}
} else {
for (int j = floor + 1; j <= mid; j++) {
temp += person[j] * (j - floor);
}
for (int j = mid + 1; j <= i; j++) {
temp += person[j] * (i - j);
}
}
temp += computePeopleStairs(i, stopNum - 1);
if (temp < minPersonStair) {
minPersonStair = temp;
floorIndex[floor][stopNum - 1] = i;
}
}
return minPersonStair;
}

}

public static void main(String[] args) {
for (int i = 0; i < totalFloorNum; i++) {
person[i] = i + 1;
}

for (int i = 0; i < totalFloorNum; i++) {
System.out.println(i + "th floor: " + person[i]);
}
int minPeopleStair = computePeopleStairs(0, totalStopNum);
System.out.println("Min stairs is " + minPeopleStair);
int stopNum = totalStopNum - 1;
int selectedFloor = floorIndex[0][stopNum];
while (stopNum >= 0) {
System.out.println(selectedFloor);
stopNum--;
if (stopNum >= 0) {
selectedFloor = floorIndex[selectedFloor][stopNum];
}
}
}
}
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值