等待分类ing
tiutiu2011
这个作者很懒,什么都没留下…
展开
-
Priority Queue 优先级队列
#include #define INF ( (1 << 31) - 1 )void swap(int *a, int *b){ int c = *a; *a = *b; *b = c;}int getParent(int child){ return child >> 1;}int leftChild(int parent){ return parent << 1;原创 2015-09-29 09:57:29 · 256 阅读 · 0 评论 -
产生某个范围内的随机数
#include #include #include #define RANDOM(start, end) ( ( rand() % (end - start + 1) ) + start )//[start, end] ( rand() % (end - start + 1) ) + start//(start, end) ( rand() % (end - start + 1原创 2015-10-10 17:22:00 · 414 阅读 · 0 评论