Printer Queue(poj 3125)
来源:互联网 发布:血观音 知乎 编辑:程序博客网 时间:2024/04/30 11:18
Description
The only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in the printer queue and you may have to wait for hours to get a single page of output.
Because some jobs are more important than others, the Hacker General has invented and implemented a simple priority system for the print job queue. Now, each job is assigned a priority between 1 and 9 (with 9 being the highest priority,
and 1 being the lowest), and the printer operates as follows.
Your problem with the new policy is that it has become quite tricky to determine when your print job will actually be completed. You decide to write a program to figure this out. The program will be given the current queue (as a list of priorities) as well as the position of your job in the queue, and must then calculate how long it will take until your job is printed, assuming that no additional jobs will be added to the queue. To simplifymatters, we assume that printing a job always takes exactly one minute, and that adding and removing jobs from the queue is instantaneous.
Because some jobs are more important than others, the Hacker General has invented and implemented a simple priority system for the print job queue. Now, each job is assigned a priority between 1 and 9 (with 9 being the highest priority,
and 1 being the lowest), and the printer operates as follows.
- The first job J in queue is taken from the queue.
- If there is some job in the queue with a higher priority than job J, thenmove J to the end of the queue without printing it.
- Otherwise, print job J (and do not put it back in the queue).
Your problem with the new policy is that it has become quite tricky to determine when your print job will actually be completed. You decide to write a program to figure this out. The program will be given the current queue (as a list of priorities) as well as the position of your job in the queue, and must then calculate how long it will take until your job is printed, assuming that no additional jobs will be added to the queue. To simplifymatters, we assume that printing a job always takes exactly one minute, and that adding and removing jobs from the queue is instantaneous.
Input
One line with a positive integer: the number of test cases (at most 100). Then for each test case:
- One line with two integers n and m, where n is the number of jobs in the queue (1 ≤ n ≤ 100) and m is the position of your job (0 ≤ m ≤ n −1). The first position in the queue is number 0, the second is number 1, and so on.
- One linewith n integers in the range 1 to 9, giving the priorities of the jobs in the queue. The first integer gives the priority of the first job, the second integer the priority of the second job, and so on.
Output
For each test case, print one line with a single integer; the number of minutes until your job is completely printed, assuming that no additional print jobs will arrive.
Sample Input
31 054 21 2 3 46 01 1 9 1 1 1
Sample Output
125#include<iostream>using namespace std;const int maxn=100+10;inline int fabs(int k) { return k>0?k:-k; }int main(){int N,n,m,a[maxn],cnt;int st,ed; //标记打印队列首尾 bool print;cin>>N;while(N--){cin>>n>>m;for(int i=0;i<n;i++)cin>>a[i]; a[m]=-a[m]; //标记出来 st=0; ed=n; cnt=0; while(st!=ed) { print=true; int k=a[st%maxn]; st++; for(int i=st;i!=ed;i++) if(fabs(a[i%maxn])>fabs(k)) //如果存在大的,该数往后排 {a[ed%maxn]=k; ed++; print=false; break; }if(print) { ++cnt; //打印时间增加 if(k<0) { cout<<cnt<<endl; break; } }}}return 0;}
本题的启示是,写代码前的思路,过程一定要正确地模拟,才能写出正确的代码。
标记的方法这里运用负数来实现,以省去为每个数字创建一个带标记的数据结构。
- poj 3125 Printer Queue
- POJ 3125 Printer Queue
- Printer Queue(poj 3125)
- poj 3125 Printer Queue
- POJ 3125 Printer Queue
- POJ 3125 Printer Queue 笔记
- POJ 3125 Printer Queue (priority queue)
- POJ 3125 Printer Queue 模拟队列
- poj 3125 Printer Queue (队列)
- POJ 3125 Printer Queue(单链表)
- POJ 3125 Printer Queue 数据结构 队列
- poj 3125.Printer Queue
- POJ 3125 && Sicily 1443 Printer Queue(模拟/队列)
- POJ 3125 && Sicily 1443 Printer Queue(模拟/队列)
- POJ 3125 Printer Queue【简单模拟a打印队列】
- POJ 3125 Printer Queue(打印队列---模拟)
- POJ 3125 Printer Queue(用队列模拟过程)
- Printer Queue
- android JNI utils/Log.h 找不到 解决方法
- eclipse 导入类 提示The import XXX cannot be resolved
- Autoconf
- jquery中正则表达式
- Flask-MongoAlchemy中文文档
- Printer Queue(poj 3125)
- poj,1363,Rails
- awk处理之案例一:awk 处理百分比的问题
- Android UI设计特效
- android基础篇------------java基础(5) (四种内部类的使用和区别)
- ARM - PcDuino 初步使用(3)- 挂载网络文件系统
- 北京IMAX影院全攻略
- phpmyadmin入侵实例
- nyist 284 && poj 2312 坦克大战(变形BFS)