CodeForces 450A 队列
2015-08-22 14:47
330 查看
Description
There are n children in Jzzhu's school. Jzzhu is going to give some candies to them. Let's number all the children from
1 to n. The
i-th child wants to get at least ai candies.
Jzzhu asks children to line up. Initially, the i-th child stands at the
i-th place of the line. Then Jzzhu start distribution of the candies. He follows the algorithm:
Give m candies to the first child of the line.
If this child still haven't got enough candies, then the child goes to the end of the line, else the child go home.
Repeat the first two steps while the line is not empty.
Consider all the children in the order they go home. Jzzhu wants to know, which child will be the last in this order?
Input
The first line contains two integers n, m(1 ≤ n ≤ 100; 1 ≤ m ≤ 100). The second line contains
n integers a1, a2, ..., an(1 ≤ ai ≤ 100).
Output
Output a single integer, representing the number of the last child.
Sample Input
Input
Output
Input
Output
Hint
Let's consider the first sample.
Firstly child 1 gets 2 candies and go home. Then child 2 gets 2 candies and go to the end of the line. Currently the line looks like [3, 4, 5, 2] (indices of the children in order of the line). Then child 3 gets 2 candies and go home, and then child 4 gets
2 candies and goes to the end of the line. Currently the line looks like [5, 2, 4]. Then child 5 gets 2 candies and goes home. Then child 2 gets two candies and goes home, and finally child 4 gets 2 candies and goes home.
Child 4 is the last one who goes home.
//队列
There are n children in Jzzhu's school. Jzzhu is going to give some candies to them. Let's number all the children from
1 to n. The
i-th child wants to get at least ai candies.
Jzzhu asks children to line up. Initially, the i-th child stands at the
i-th place of the line. Then Jzzhu start distribution of the candies. He follows the algorithm:
Give m candies to the first child of the line.
If this child still haven't got enough candies, then the child goes to the end of the line, else the child go home.
Repeat the first two steps while the line is not empty.
Consider all the children in the order they go home. Jzzhu wants to know, which child will be the last in this order?
Input
The first line contains two integers n, m(1 ≤ n ≤ 100; 1 ≤ m ≤ 100). The second line contains
n integers a1, a2, ..., an(1 ≤ ai ≤ 100).
Output
Output a single integer, representing the number of the last child.
Sample Input
Input
5 2 1 3 1 4 2
Output
4
Input
6 41 1 2 2 3 3
Output
6
Hint
Let's consider the first sample.
Firstly child 1 gets 2 candies and go home. Then child 2 gets 2 candies and go to the end of the line. Currently the line looks like [3, 4, 5, 2] (indices of the children in order of the line). Then child 3 gets 2 candies and go home, and then child 4 gets
2 candies and goes to the end of the line. Currently the line looks like [5, 2, 4]. Then child 5 gets 2 candies and goes home. Then child 2 gets two candies and goes home, and finally child 4 gets 2 candies and goes home.
Child 4 is the last one who goes home.
//队列
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<queue> using namespace std; struct node { int a,b; } p,t; int main() { queue<node> q; int n,m; while(~scanf("%d%d",&n,&m)) { int top=-1; for(int i=0; i<n; i++) { scanf("%d",&p.a); p.b=i+1; if(p.a-m>0) { p.a-=m; q.push(p); top=p.b; } } // t=q.top(); // printf("%d\n",t.a); if(top==-1) printf("%d\n",n); else { while(!q.empty()) { t=q.front(); q.pop(); if(t.a-m>0) { t.a-=m; q.push(t); top=t.b; } } printf("%d\n",top); } } }
相关文章推荐
- Nginx基础知识. Nginx网络属性
- hdu1014 Uniform Generator
- 数据结构课程的实践方法指导
- 洛谷1012 拼数
- 多源点、多汇点最大流问题
- 一篇短文看懂天津港事件(转)
- IOS开发之对象生命周期
- 归并排序(C/C++)
- CodeForces 453A 概率题
- python中的装饰符@
- Gtk与Qt编译环境安装与配置
- 报错:1130-host ... is not allowed to connect to this MySql server 开放mysql远程连接 不使用localhost
- js 实现class作为选择器
- Linux sed命令删除指定行
- Cocos2d—android 中常用的工具类
- js 中class选择器,addClass,removeClass,hasClass,toggleClass,getByClass
- Spring Autowiring @Qualifier example
- 关于将缓冲器内容写入文件
- centos常用命令
- 四 HDU 2090