龙豆

摘要： /* * RED-BLACK-TREE * */#include <cstdio>using namespace std;const int MAXN = 10000;const int RED = 0, BLACK = 1, ROOT = 0;struct SData{ int key, color; SData *left, *right, *p;};SData *rbtree[MAXN];SData *nil = new SData;void ini(){ nil->color = BLACK; rbtree[ROOT] = nil;}SData *rb_minimum 阅读全文

摘要： /* * hash。。 链表法 * 3349.cpp * * 需注意如何判断两个雪花一样 * 看数据： * 1 1 2 0 0 0 * 1 1 0 0 0 2 * * Created on: 2011-7-21 * Author: */#include <cstdio>using namespace std;const int MAXN = 100000 + 5;int n;bool vis[MAXN] = {};struct SData{ int a[6]; SData *pre, *next;};SData *table[MAXN];SData snow[MAXN];//相加 阅读全文

摘要： /* * 二叉查找树练习 * 2418.cpp * * Created on: 2011-7-21 * Author: */#include <cstdio>#include <cstring>using namespace std;const int maxs = 10000 + 5;const int ROOT = 0;struct SData{ char name[35]; int num; SData *left, *right; SData(): num(0), left(NULL), right(NULL) {}};SData *tree[maxs];int 阅读全文