route

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct Node
{
struct Node* left;
struct Node* right;
int data;
};
int n = 0;
int Cal(struct Node*);//计算
int main(int argc,char* argv[])
{
scanf("%d",&n);
struct Node** tree = malloc(sizeof(struct Node*)*n);
//init tree
int size = 1;
int i;
for(i = n; size <= n; size++)
{
tree[size-1] = (struct Node*)malloc(sizeof(struct Node)*size);//一共n跳，每一跳有i个
int data[size];
for(i = 0; i < size; i++)
{
scanf("%d",&data[i]);
}
int j;
for(j = 0; j < size; j++)
{
tree[size-1][j].data = data[j];
}
printf("\n");
}


//


for(i = 0; i < n; i++)
{
int j;
for(j = 0; j <= i; j++)
{
if(i==n-1)
{
tree[i][j].left = NULL;
tree[i][j].right = NULL;


}
else
{
tree[i][j].left = &tree[i+1][j];
tree[i][j].right = &tree[i+1][j+1];
}
}
}


//
int max = Cal(&tree[0][0]);
printf("\n%d\n",max);
system("PAUSE");
return 0;
}


int Cal(struct Node* sub)
{
int max;
int sum1 = 0;int sum2 = 0;
if(sub!=NULL)
{
if(sub->left!=NULL)
{
sum1 +=Cal(sub->left);
}
else
{
return sub->data;
}
}
if(sub!=NULL)
{
sum2 +=Cal(sub->right);
}
if(sum1 > sum2)
{
max = sub->data + sum1;
}
else
{
max = sub->data + sum2;
}
return max;

}以上是计算路由最大跳数