简单数据结构
文章平均质量分 73
.
ComBoat
俺好菜呀o(╥﹏╥)o
展开
-
POJ 3190 Stall Reservations(贪心 优先队列)
DescriptionOh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A…B (1 <= A <= B <= 1,000,000), which includes both times A and B. Obviously, FJ must create a reservat原创 2021-02-21 19:28:22 · 147 阅读 · 0 评论 -
优先队列用法
普通队列是按照加入至队列中的顺序排列,先进先出而优先队列是按照某一规定的顺序排列,优先级高的先出使用优先队列和普通队列一样,需包含头文件queuepriority_queue<Type, Container, Functional>函数基本与普通队列相同,访问首元素普通队列是front(),优先队列是top()。默然按照从大到小的顺序#include<iostream>#include<queue>using namespace std;int mai原创 2021-02-21 17:23:39 · 200 阅读 · 0 评论 -
HDU 1075 What Are You Talking About(map)
Problem DescriptionIgnatius is so lucky that he met a Martian yesterday. But he didn’t know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want to translate the history book into E原创 2021-02-18 21:55:28 · 150 阅读 · 0 评论 -
POJ 1896 Stones(优先队列)
Problem DescriptionBecause of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games this time.There are many stones on the road, when原创 2021-02-18 21:29:23 · 98 阅读 · 0 评论 -
POJ 1387 Team Queue
Problem DescriptionQueues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the queue in front of the Mensa is a team原创 2021-02-08 16:39:09 · 214 阅读 · 0 评论