import java.util.Scanner;
/*** @time 2016-06-11* @Description 计算任务时间表问题*/
public class TimeTable {//声明静态的扫描器类便于调用static Scanner in = new Scanner(System.in);/*** 主方法* @param args*/public static void main(String args[]) {/*** 测试用例 * int[] v1 = { 0, 4, 2, 4, 3, 1, 4, 6 }; * int[] w1 = { 0, 70, 60,50, 40, 30, 20, 10 };*/System.out.println("请输入任务集的大小：");int size = in.nextInt();int[] v1 = new int[size + 1];int[] w1 = new int[size + 1];
int[] indexs=new int[v1.length];int time = 0;int passtime = 0;
for (int i = 0; i < indexs.length; i++) {indexs[i]=i;}System.out.println("请分别输入各任务截至时间：");for (int i = 1; i <= size; i++) {System.out.print("第" + i + "个任务的截至时间：");time = in.nextInt();v1[i] = time;}System.out.println("请分别输入各任务误时惩罚：");for (int i = 1; i <= size; i++) {System.out.print("第" + i + "个任务的误时惩罚：");passtime = in.nextInt();w1[i] = passtime;}int[] u1 = new int[v1.length];new TimeTable().show(v1, w1, u1,indexs);}/*** 显示方法show* @param v1 截止时间* @param w1 误时惩罚* @param u1 最优时间表*/public void show(int[] v1, int[] w1, int[] u1,int[] indexs) {SuperSort(v1, w1,indexs);int total=greedyjob(v1, w1, u1);System.out.println("<<时间表问题>>");while (true) {System.out.println("\n1.总误时惩罚为");System.out.println("2.最优时间表为");System.out.println("0.退出\n");System.out.println("---------------------------------");System.out.print("请选择>");int choose = in.nextInt();switch (choose) {case 1:System.out.println("总误时惩罚为：" +total);System.out.println("-----------------------------");break;case 2:System.out.print("最优时间表为：");for (int i = 1; i <= v1.length - 1; i++) {System.out.print(indexs[u1[i]] + "  ");}
System.out.println();System.out.println("-----------------------------");             break;case 0:System.err.println("退出成功！");System.out.println("-----------------------------");                System.exit(0);}}}/*** 主要计算方法* @param d 截止时间* @param w 误时惩罚* @param job 最优时间表* @return 总误时惩罚*/public int greedyjob(int[] d, int[] w, int[] job) {int n = d.length - 1;d[0] = 0;job[0] = 0;int k = 1;job[1] = 1;int sum = 0;for (int i = 2; i <= n; i++) {int r = k;while ((d[job[r]] > d[i]) && (d[job[r]] != r)) {r--;}if ((d[job[r]] <= d[i]) && (d[i] > r)) {for (int m = k; m > r; m--) {job[m + 1] = job[m];}job[r + 1] = i;k++;}}for (int i = 1; i <= k; i++) {w[job[i]] = 0;}for (int i = 1; i <= n; i++) {if (w[i] > 0) {job[++k] = i;sum += w[i];}}return sum;}
/*** 排序：对相同截止时间的误时惩罚进行降序排列；* @param d 截止时间* @param w 误时惩罚*/public void superSort(int[] d, int[] w, int[] indexs) {for (int i = 1; i < d.length - 1; i++) {for (int j = i + 1; j < d.length; j++) {if (w[i] < w[j]) {int temp = w[i];w[i] = w[j];w[j] = temp;temp = indexs[i];indexs[i] = indexs[j];indexs[j] = temp;temp = d[i];d[i] = d[j];d[j] = temp;}}}}
}
}