#include #include #define max 1001 using namespace std; int map[max][max]; bool visited[max]; int num; struct node { int value; node * pre; }; int getFirst(int v) { int i=0; for(i=1;i<num;i++) {

#include using namespace std; struct node { char value; node * lchild; node * rchild; }; node * create() { node * pnode=NULL; char t; cin>>t; if(t=='#') return NULL; else { pnode = (node

#include using namespace std; void swap(int * a,int *b); void AdjustHeap(int data[],int start,int end) { int j=2*start+1; //int temp=data[start]; while(j { if(j==3) ; if(data[j] if(data[

#include using namespace std; //st1->end 和end+1->到n这两个数列的归并算法 void merge(int * data,int st1,int end,int endend) { int length1= end-st1+1; int length2= endend-end; int* L = new int[length1]; int

#include #include #include using namespace std; void swap(int *a,int*b) { int temp =*a; *a=*b; *b=temp; } int random(int st,int end) { int length = end-st+1; return st+rand()%length; } int

#include #include #define maxnum 1000 #define edgemax 2000; using namespace std; int edges; int node[maxnum]; int nodenum; struct edge { int value; int a; int b; //a to b is edge }; edge e[maxn

#include using namespace std; int map[11]={0,1,5,8,9,10,17,17,20,24,30}; int max(int a,int b) { return (a>b?a:b); } bool flag[1000]; int rom[1000]; int cut(int n) { if(flag[n]) return rom[n]; fl

#include #include #include using namespace std; struct Node{ char val; Node * l; Node * r; }; int indexOf(const char * str,char val,int size) { int i=0; for(i=0;i<size;i++) { if(str[i]==v