hdu 1896 优先队列
来源:互联网 发布:unity3d 2d地图 编辑:程序博客网 时间:2024/06/02 02:07
题目:
Stones
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2757 Accepted Submission(s): 1778
Problem Description
Because 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 he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.
Input
In the first line, there is an Integer T(1<=T<=10), which means the test cases in the input file. Then followed by T test cases.
For each test case, I will give you an Integer N(0<N<=100,000) in the first line, which means the number of stones on the road. Then followed by N lines and there are two integers Pi(0<=Pi<=100,000) and Di(0<=Di<=1,000) in the line, which means the position of the i-th stone and how far Sempr can throw it.
For each test case, I will give you an Integer N(0<N<=100,000) in the first line, which means the number of stones on the road. Then followed by N lines and there are two integers Pi(0<=Pi<=100,000) and Di(0<=Di<=1,000) in the line, which means the position of the i-th stone and how far Sempr can throw it.
Output
Just output one line for one test case, as described in the Description.
Sample Input
221 52 421 56 6
Sample Output
1112
Author
Sempr|CrazyBird|hust07p43
Source
HDU 2008-4 Programming Contest
Recommend
lcy | We have carefully selected several similar problems for you: 1892 1899 1895 1894 1897
代码:
#include<stdio.h>#include<iostream>#include<queue>#include<algorithm>using namespace std;struct node{ int p,d; node(int pp,int dd){ p=pp; d=dd; } bool operator< (const node & a)const{ if(p==a.p) return d>a.d;///////>>>>>>>>>>>>>> else return p>a.p;/////............... }};int t,n,a,b;priority_queue<node> qu;int main(){///265MS3480K scanf("%d",&t); while(t--){ scanf("%d",&n); while(!qu.empty()) qu.pop(); for(int i=1;i<=n;++i) scanf("%d%d",&a,&b),qu.push(node(a,b)); int num=0,ans=0; //node tmp; while(!qu.empty()){ node tmp=qu.top(); qu.pop(); num++; //cout<<num<<" "<<tmp.p<<" "<<tmp.d<<endl; if(num%2) qu.push(node(tmp.p+tmp.d,tmp.d)); else ans=max(ans,tmp.p); } printf("%d\n",ans); } return 0;}
优先队列比较函数的另外两种姿势:
http://www.cnblogs.com/hxsyl/archive/2012/08/30/2662955.html
http://blog.csdn.net/liangzhaoyang1/article/details/52876788
阅读全文
0 0
- hdu 1896 优先队列
- hdu 1896 优先队列
- HDU 1896 优先队列
- HDU 1896 Stones(优先队列)
- hdu 1896 Stones 优先队列
- hdu 1896 Stones(优先队列)
- HDU 1896 Stones (优先队列)
- HDU 1896 Stones 【优先队列】
- HDU 1896 Stones(优先队列)
- HDU 1896 Stones 优先队列
- HDU 1896 Stones 优先队列
- HDU 1896 Stones --优先队列+搜索
- hdu 1896 优先队列的应用
- HDU 1896 -- Stones (优先队列)
- hdu 杭电1896 Stones【优先队列】
- HDU 1896 Stones(优先队列)
- 【HDU]-1896-Stones(优先队列,好)
- HDU:1896 Stones(优先队列)
- 【android】禁止EditText自动获取焦点
- 循环删除list中元素的方法
- HBase 的那一点知识
- JavaScript事件
- 51nod1240 莫比乌斯函数(普通筛法)
- hdu 1896 优先队列
- 判断文件或者文件夹是否存在
- HDU 1829 A Bug's Life(基础种类并查集)
- struts2中I18N国际化
- Linux GNU Makefile之初识
- JAVA线程知识
- [LeetCode] 461.Hamming Distance 备忘
- SQL中Group By的使用
- ps命令