题目:
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.
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.
2 2 1 5 2 4 2 1 5 6 6
11 12
题意:路上有一串石头,当遇到第奇数个石头时,就将他扔出Di,否则就不管它。求最远的石头。
思路:用STL中的优先队列。
源程序:
//By Sean Chen #include <iostream> #include <cstdio> #include <queue> #include <vector> using namespace std; struct stone{ //创造stone结构体,记录石头的初始位置,和扔的距离 int pos,dis; }; struct cmp //重载运算符 { bool operator() (const stone &s1,const stone &s2) { if(s1.pos!=s2.pos) return s1.pos>s2.pos; return s1.dis>s2.dis; } }; priority_queue<stone,vector<stone>,cmp> q; //建立优先队列 int main() { int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); for(int i=1;i<=n;i++) { stone s; scanf("%d%d",&s.pos,&s.dis); q.push(s); } int cnt=1; while(!q.empty()) { stone t=q.top(); q.pop(); if(cnt%2!=0) //第奇数颗石头,加上扔出的距离,并压入队列 { t.pos+=t.dis; q.push(t); } if(q.empty()) printf("%d\n",t.pos); cnt++; } } return 0; }