队列
亿念之茶
I'm a newbie,but i believe i could fly one day!
展开
-
优先队列 用实验说明问题
优先队列详解写了一堆代码#include #include #include #include#includeusing namespace std; //定义结构,使用运算符重载,自定义优先级1 struct cmp1{ bool operator ()(int &a,int &b){ return a>b;//最小值优先原创 2015-07-27 21:21:30 · 506 阅读 · 0 评论 -
hdoj 1509 Windows Message Queue(优先队列)
Windows Message Queue点击打开链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4309 Accepted Submission(s): 1701Problem DescriptionMe原创 2015-07-24 20:08:36 · 693 阅读 · 0 评论 -
hdoj 1873 看病要排队(优先队列的运用)
看病要排队Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5771 Accepted Submission(s): 2371Problem Description看病要排队这个是地球人都知道的常识。不过经过细心的0原创 2015-07-24 15:50:05 · 632 阅读 · 0 评论 -
hdoj 4006 The kth great number(优先队列)
The kth great numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 8165 Accepted Submission(s): 3230点击打开链接Problem DescriptionXiao Mi原创 2015-07-24 17:09:51 · 340 阅读 · 0 评论 -
hdoj 1896 Stones (优先队列)
Stones点击打开链接Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1348 Accepted Submission(s): 839Problem DescriptionBecause of the wro原创 2015-07-24 19:21:17 · 362 阅读 · 0 评论 -
Zoj 1671 Walking Ant(BFS+优先队列||记忆化搜索)
Walking AntTime Limit: 2 Seconds Memory Limit: 65536 KB点击打开链接Ants are quite diligent. They sometimes build their nests beneath flagstones.Here, an ant is walking in a rectangular are原创 2015-08-06 21:16:14 · 651 阅读 · 0 评论