下落时间问题

 Problem Statement????An object is placed in the xy-plane at coordinates (x,y), where x > 0 and y > 0. The object begins falling straight down toward the x-axis at a speed of one unit per second. Along the way, it may encounter some obstacles. Each obstacle is a horizontal line segment, and the object hits an obstacle when their y-coordinates are equal and the object's x-coordinate is between the x-coordinates of the obstacle's endpoints (inclusive). Each time the object hits an obstacle, it will be delayed 5 seconds. During this delay, the object will travel to the right endpoint of the obstacle (the one with the greater x-coordinate). The object will then continue to fall straight down from that point.You are given the object's initial position (x,y) and a vector <string> describing the obstacles. Return the number of seconds it will take for the object to finally reach the x-axis. Each element of obstacles is formatted "y x1 x2" (quotes for clarity only), where y is the y-coordinate of an obstacle, and x1 and x2 are the left and right x-coordinates of that obstacle's endpoints respectively.Definition????Class:ObjectFallMethod:howLongParameters:int, int, vector <string>Returns:intMethod signature:int howLong(int x, int y, vector <string> obstacles)(be sure your method is public)???? Constraints-x will be between 1 and 1000, inclusive.-y will be between 1 and 1000, inclusive.-obstacles will contain between 0 and 50 elements, inclusive.-Each element of obstacles will be formatted "y x1 x2" (quotes for clarity only).-Each y, x1 and x2 in obstacles will be an integer between 001 and 999, inclusive, and contain exactly 3 digits.-In each element of obstacles, x1 will be less than or equal to x2.-obstacles will contain no duplicate y values.Examples0) ????1510{"005 010 020"}Returns: 15The object starts at (15,10), and when it reaches (15,5), it hits the obstacle and is delayed 5 seconds.1) ????1512{"010 010 020","015 010 020","005 020 050"}Returns: 22The object hits the obstacle at y = 10 and moves to (20,10). From there it continues to fall until it hits the object at y = 5. Finally, it falls to the x-axis at (50,0). The total time is: 2 seconds before hitting the first obstacle + 5 seconds of delay + 5 seconds until hitting the next obstacle + 5 seconds of delay + 5 seconds until hitting the x-axis = 22 seconds.2) ????5085{"020 001 100","010 100 100","005 100 200"}Returns: 100The object hits all three obstacles, even the one that is a point.3) ????101000{}Returns: 1000A free-fall to the x-axis.4) ????500800{"800 001 500","400 001 499","401 501 999"}Returns: 805 5) ????645802{"739 038 799","916 169 791","822 372 911","162 125 992","261 307 545", "510 031 765","592 723 742","477 315 676","566 143 617","337 114 664", "986 648 883","116 230 680","254 746 943","742 948 988","060 117 401", "634 035 433","288 741 864","819 626 730","906 071 222","554 100 121", "573 051 551","949 528 915","562 151 223","857 135 243","621 115 474", "588 405 615","895 812 919","052 378 836","858 116 505","285 428 469", "792 244 250","109 265 637","714 804 885","625 150 410","518 593 921", "282 235 339","081 212 659","663 047 982","556 194 345","798 150 938", "391 026 813","886 348 796","975 007 743","053 854 895","243 561 875"}Returns: 817 This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved. 注意vector的常见函数（sort,copy,reserve等）的用法将字符型转换了整形的一种方便的方法1.用sstream2.  用ch-‘0’ 我的解法： #include <iostream>#include <vector>#include <algorithm>using namespace std; class ObjectFall{ public:  int howLong(int x, int y, vector <string> obstacles) {  int totalTime=y;  vector <string> obsCopy(obstacles.size());  copy(obstacles.begin(),obstacles.end(),obsCopy.begin());  sort(obsCopy.begin(),obsCopy.end());  reverse(obsCopy.begin(),obsCopy.end());  for (int i=0;i<obsCopy.size();i++)  {   int Y=(obsCopy[i].at(0)-'0')*100+(obsCopy[i].at(1)-'0')*10+(obsCopy[i].at(2)-'0');   int x1=(obsCopy[i].at(4)-'0')*100+(obsCopy[i].at(5)-'0')*10+(obsCopy[i].at(6)-'0');   int x2=(obsCopy[i].at(8)-'0')*100+(obsCopy[i].at(9)-'0')*10+(obsCopy[i].at(10)-'0');   if ((Y<=y)&&(x>=x1)&&(x<=x2))   {    totalTime+=5;    x=x2;    y=Y;   }  }  return totalTime; }};