- 选课
- 2009-02-28 16:58:47 @
#include
using namespace std;
struct Node
{int left,right;
int num;
}Tree[301];
int f[301][301];
int n,m;
void mine (int a,int b)
{int k1,k2,i;
if(a>m;
for(i=0;ia>>b;
Tree[i].right=Tree[a].left;
Tree[a].left=i;
Tree[i].num=b;
}
mine(Tree[0].left,m);//主过程
cout
0 条评论
目前还没有评论...