Hust oj 1046 Balls Collision（水题）

Balls Collision

Time Limit: 1000 MS Memory Limit: 65536 K Total Submit: 71(51 users) Total Accepted: 49(45 users) Rating: Special Judge: No

Description

There is an absolutely slippery groove whose length is M miles and the width is 0.2 mile. N balls whose weights are all the same and the radiuses are all 0.1 mile roll in the groove at the speed of 1mile/s in the direction of left or right. when two balls come into collision, there is no energy lost. Your task is to write a program to output the time at which the first ball rolls down the groove and the time at which the last ball rolls down the groove.

Input

The input file contains several test cases. The description of each case starts with a line containing two integers M (0<=M<=1000000) and N (1<=N<=100). Each of the following N lines contains the direction (R presents the direction of right and L presents the direction of left) and the distance (in miles) from the left side of the groove at starting time. The input is terminated by a test case with M= 0 and N = 0. It should not be processed.

Output

For each test case you should output the time (in second) at which the first ball rolls down the groove and the time (in second) at which the last ball rolls down the groove in a single line.

Sample Input

10 2 R 3 R 9 20 3 L 1 L 11 R 9 0 0

Sample Output

1 7 1 11 这题都快做烂了啊= =蚂蚁感冒 #include<cstdio> #include<iostream> #include<cstring> #include<cmath> #include<algorithm> using namespace std; int n,m; int x; int Max,Min; char desc; int main() { while(~scanf("%d%d",&m,&n) && (n+m)) { Max = -1; Min = 0x3f3f3f; getchar(); for(int i=0;i<n;i++) { scanf("%c %d",&desc,&x); getchar(); if(desc == 'L') { int temp = x; if(Max < temp) Max = temp; if(Min > temp) Min = temp; } else { int temp = m - x; if(Max < temp) Max = temp; if(Min > temp) Min = temp; } } printf("%d %d\n",Min,Max); } }