package 递归分治;
//设有n=2^k个运动员进行循环赛,设计一个比赛日程表
//每个选手必须与其他n-1个选手各赛一次
//每个选手一天只能进行一场比赛
//循环赛一共要进行n-1天
//日程表设计成n行n-1列的表格,其中第i行j列表示第i个选手在第j天遇到的选手
public class round_robin {
private static int[][] a;
public round_robin(int k) {
int n = (int) Math.pow(2, k);
a = new int[n + 1][n + 1];
}
public static void table(int k) {
int n = 1;
for (int i = 1; i <= k; i++)
n *= 2;
for (int i = 1; i <= n; i++)
a[1][i] = i;
int m = 1;
for (int s = 1; s <= k; s++) {
n /= 2;
for (int t = 1; t <= n; t++)
for (int i = m + 1; i <= 2 * m; i++)
for (int j = m + 1; j <= 2 * m; j++) {
a[i][j + (t - 1) * m * 2] = a[i - m][j + (t - 1) * m
* 2 - m];
a[i][j + (t - 1) * m * 2 - m] = a[i - m][j + (t - 1)
* m * 2];
}
m *= 2;
}
}
public static void main(String[] args) {
}
}
递归分治算法之比赛日程表(Java版本)
最新推荐文章于 2019-03-23 17:11:07 发布