|
| 1 | +/* |
| 2 | +Problem:比赛日程表 |
| 3 | +Author:QiZhao |
| 4 | +Data:2018-09-30 |
| 5 | +Description: |
| 6 | +Copyright 2018 QiZhao. All rights reserved. |
| 7 | +*/ |
| 8 | + |
| 9 | +#include<iostream> |
| 10 | +class calendar |
| 11 | +{ |
| 12 | + public: |
| 13 | + calendar(int nn);// 构造函数,间接实现动态二维数组 |
| 14 | + ~calendar();// 析构函数 |
| 15 | + void print_to_crt();// 输出到显示器 |
| 16 | + void print_to_file();// TODO 输出到文件 |
| 17 | + protected: |
| 18 | + void solve(int start,int n); |
| 19 | + private: |
| 20 | + bool solve_finished; //是否被solve过 |
| 21 | + int n=0;//数组大小 |
| 22 | + int **ans; |
| 23 | +}; |
| 24 | + |
| 25 | +calendar::calendar( int nn ) |
| 26 | +{ |
| 27 | + solve_finished=false; |
| 28 | + n = nn; |
| 29 | + ans = new int *[n+3]; |
| 30 | + for( int i = 0 ; i <= n + 2 ; i++) |
| 31 | + ans[i] = new int[n+1]; |
| 32 | + for( int i = 1 ; i <= n ; i++) |
| 33 | + ans[i][0] = i ; |
| 34 | +} |
| 35 | + |
| 36 | +calendar::~calendar() |
| 37 | +{ |
| 38 | + for( int i = 0 ; i < n + 1 ; i++) |
| 39 | + delete[] ans[i]; |
| 40 | + delete[] ans; |
| 41 | +} |
| 42 | + |
| 43 | +void calendar::print_to_crt() |
| 44 | +{ |
| 45 | + if( !solve_finished ) |
| 46 | + { |
| 47 | + solve( 1,n); |
| 48 | + solve_finished = true; |
| 49 | + } |
| 50 | + //cout << "\t\t\t" << n << "人日程表" << endl; |
| 51 | + int day=n%2==0?n-1:n; |
| 52 | + for(int i = 1; i <= n; i++) |
| 53 | + { |
| 54 | + for(int j = 0; j <= day; j++) |
| 55 | + { |
| 56 | + std::cout << ans[i][j] << " "; |
| 57 | + } |
| 58 | + std::cout << std::endl; |
| 59 | + } |
| 60 | + std::cout<<"--------------"<<std::endl; |
| 61 | +} |
| 62 | +void calendar::solve(int start, int n) |
| 63 | +{ |
| 64 | + int temp; |
| 65 | + if(n == 2)//只有2人,直接安排赛程 |
| 66 | + { |
| 67 | + ans[start][1] = ans[start + 1][0]; |
| 68 | + ans[start + 1][1] = ans[start][0]; |
| 69 | + } |
| 70 | + else |
| 71 | + { |
| 72 | + if(n % 2 == 1) //n为奇数 |
| 73 | + { |
| 74 | + temp = ans[start + n][0]; |
| 75 | + ans[start + n][0] = 0; |
| 76 | + solve(start, n + 1); |
| 77 | + ans[start+n][0] = temp; |
| 78 | + } |
| 79 | + else//n为偶数 |
| 80 | + { |
| 81 | + int m = n / 2; |
| 82 | + solve(start, m); |
| 83 | + solve(start + m, m); |
| 84 | + if(m % 2 == 1)//m为奇数,安排第m+1天到第n-1天的赛程 |
| 85 | + { |
| 86 | + for(int i = start; i < start + m; i++)//安排两组中轮空的2个选手比赛 |
| 87 | + { |
| 88 | + for(int j = 1; j <= m; j++) |
| 89 | + { |
| 90 | + if(ans[i][j] == 0) |
| 91 | + { |
| 92 | + ans[i][j] = ans[i + m][0]; |
| 93 | + ans[i + m][j] = ans[i][0]; |
| 94 | + } |
| 95 | + } |
| 96 | + } |
| 97 | + for(int i = 1; i <= m; i++) |
| 98 | + { |
| 99 | + for(int j = m + 1; j < n; j++) |
| 100 | + { |
| 101 | + int temp = (i + j - 1) % m + m + 1; |
| 102 | + ans[start + i - 1][j] = ans[start + temp - 1][0]; |
| 103 | + ans[start + temp - 1][j] = ans[start + i - 1][0]; |
| 104 | + } |
| 105 | + } |
| 106 | + } |
| 107 | + else//m为偶数,安排第m天到第n-1天的赛程 |
| 108 | + { |
| 109 | + for(int i = 1; i <= m; i++) |
| 110 | + { |
| 111 | + for(int j = m; j <= n - 1; j++) |
| 112 | + { |
| 113 | + int temp = (i + j - 1) % m + m + 1; |
| 114 | + ans[start + i - 1][j] = ans[start + temp - 1][0]; |
| 115 | + ans[start + temp - 1][j] = ans[start + i - 1][0]; |
| 116 | + } |
| 117 | + } |
| 118 | + } |
| 119 | + } |
| 120 | + } |
| 121 | +} |
| 122 | + |
0 commit comments