#include #include #include #define SIZE 5 #define VALUE_RANGE 9 /* * Provided by my co-worker, Weiyuan Chen. */ int getNUM(int n){ int sum = 0; for(int i=1;i<=n;i++) { sum+=i; } return sum; } const int NUM = getNUM(SIZE); struct Node { int value; int rank; int chose; Node* next[2]; void set_para(int Value) { value = Value; rank = 0; chose = -1; next[0] = NULL; next[1] = NULL; } void link_next(Node* n1, Node* n2) { next[0] = n1; next[1] = n2; } void cal_rank() { rank = value; if(next[0]!=NULL && next[1]!=NULL) { chose = next[0]->rank < next[1]->rank; rank += next[chose]->rank; } } }; void init (Node tree[]); void show (Node tree[], bool type); void cal (Node tree[]); void show_best (Node tree[]); //================================================================== int main(void) { srand(time(NULL)); Node tree[NUM]; init(tree); show(tree, false); cal(tree); show(tree, true); show_best(tree); return 0; } //================================================================== void init (Node tree[]) { int space = 0; int par_space = 0; for(int i=0;i0){ for(int j=0;j<=i-1;j++){ tree[ j+par_space ].link_next(&tree[ j+space ], &tree[ j+space+1 ]); } } par_space+=i; } } //================================================================== void show (Node tree[], bool type) { printf("=====================\n"); int space = 0; for(int i=0;ii;j--) printf(" "); for(int j=0;j<=i;j++) { int index = j+space; printf(" %d ",tree[index].value); } printf("\n"); if(type) { for(int j=SIZE;j>i;j--) printf(" "); for(int j=0;j<=i;j++) { int index = j+space; if(tree[index].chose == 0) printf(" / "); else if(tree[index].chose == 1) printf(" \\ "); } printf("\n"); } } } //================================================================== void cal (Node tree[]) { for(int i=NUM-1;i>=0;i--) { tree[i].cal_rank(); } } //================================================================== void show_best (Node tree[]) { printf("=====================\n"); Node *temp = &tree[0]; int SUM = 0; for(int i=0;i0) printf("->"); printf("%d",temp->value); SUM += temp->value; temp = temp->next[temp->chose]; } printf(" = %d\n",SUM); }

Golden Mountain 2018/01/21