ACM程序设计04.ppt

堆 堆heap是一个完全二叉树 可以用一维数组来实现 堆中存储的数据是局部有序的 堆有两类：大根堆和小根堆 大根堆的最大值一定是根 小根堆的最小值一定是根 和优先队列一样，将优先级最高的放在队首 堆 堆可以实现优先队列，也是一种排序算法 堆的基本操作 删除优先级最高的元素，三步： 1 直接删除根 2 将最后一个元素代替根 3 将堆向下重新调整 在堆中插入一个新元素：插入元素先添加到末尾，再向上调整 Argus poj2051 Description A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, financial tickers, on-line auctions, and transaction logs such as Web usage logs and telephone call records. Likewise, queries over streams run continuously over a period of time and incrementally return new results as new data arrives. For example, a temperature detection system of a factory warehouse may run queries like the following. Query-1: Every five minutes, retrieve the maximum temperature over the past five minutes. Query-2: Return the average temperature measured on each floor over the past 10 minutes.We have developed a Data Stream Management System called Argus, which processes the queries over the data streams. Users can register queries to the Argus. Argus will keep the queries running over the changing data and return the results to the corresponding user with the desired frequency. For the Argus, we use the following instruction to register a query: Register Q_num PeriodQ_num (0 Q_num = 3000) is query ID-number, and Period (0 Period = 3000) is the interval between two consecutive returns of the result. After Period seconds of register, the result will be returned for the first time, and after that, the result will be returned every Period seconds. Here we have several different queries registered in Argus at once. It is confirmed that all the queries have different Q_num. Your task is to tell the first K queries to return the results. If two or more queries are to return the results at the same time, they will return the results one by one in the ascending order of Q_num.  Argus poj2051 Input The first part of the input are the register instructions to Argus, one instruction per line. You can a