UV problem solution: 10191-longest nap

Quite simple question. I add two sentinels to avoid boundary checks. however, the input format is tricky to handle. at first, I use scanf ("% 2D: % 2D % 2D: % 2D % * [^/n]/n ,...) to read the input. after some was, I finally realize that there cocould be nothing left in a line after the time.

Code:

1. /*************************************** **********************************
2. * Copyright (c) 2008 by liukaipeng *
3. * Liukaipeng at gmail dot com *
4. **************************************** *********************************/
6. /* @ Judge_id 00000 10191 C ++ "Longest nap "*/
8. # Include <algorithm>
9. # Include <cstdio>
10. # Include <deque>
11. # Include <fstream>
12. # Include <iomanip>
13. # Include <iostream>
14. # Include <list>
15. # Include <map>
16. # Include <queue>
17. # Include <set>
18. # Include <stack>
19. # Include <string>
20. # Include <vector>
22. Using namespace STD;
24. Int const appcount = 102;
25. Int const linesize = 256;
27. Struct mytime
28. {
29. Mytime (INT h = 0, int m = 0): hour (H), minute (m ){}
30. Int hour;
31. Int minute;
32. };
34. Inline mytime operator-(mytime const & T1, mytime const & T2)
35. {
36. Int M = (t1.hour-t2.hour) * 60 + t1.minute-t2.minute;
37. Return mytime (M/60, M % 60 );
38. }
40. Inline bool operator> (mytime const & T1, mytime const & T2)
41. {
42. Return t1.hour> t2.hour | t1.hour = t2.hour & t1.minute> t2.minute;
43. }
45. Typedef pair <mytime, mytime> appointment;
47. Struct appcmp
48. {
49. Bool operator () (Appointment const & A1, appointment const & A2)
50. {
51. Return a1.first. Hour <a2.first. Hour |
52. A1.first. Hour = a2.first. Hour & a1.first. Minute <a2.first. minute;
53. }
54. };
56. Void find_nap (Appointment * apps, int napps, mytime & START, mytime & last)
57. {
58. Sort (apps + 1, apps + napps + 1, appcmp ());
59. Last. Hour = 0;
60. Last. Minute = 0;
61. For (INT I = 0; I <= napps; ++ I ){
62. Mytime T = apps [I + 1]. First-apps [I]. Second;
63. If (T> last ){
64. Last = T;
65. Start = apps [I]. Second;
66. }
67. }
68. }
70. Int main (INT argc, char * argv [])
71. {
72. # Ifndef online_judge
73. Freopen (string (argv [0]) + ". In"). c_str (), "r", stdin );
74. Freopen (string (argv [0]) + ". Out"). c_str (), "W", stdout );
75. # Endif
77. Int napps;
78. For (INT day = 1; CIN> napps; ++ day ){
79. Appointment apps [appcount];
80. For (INT I = 1, C; I <= napps; ++ I ){
81. Scanf ("% 2D: % 2D % 2D: % 2D ",
82. & Apps [I]. First. Hour, & apps [I]. First. Minute,
83. & Apps [I]. Second. Hour, & apps [I]. Second. Minute );
84. Cin. Ignore (2048, '/N ');
85. }
86. Apps [0] = make_pair (mytime (9, 0), mytime (10, 0 ));
87. Apps [napps + 1] = make_pair (mytime (18, 0), mytime (19, 0 ));
89. Mytime start, last;
90. Find_nap (apps, napps, start, last );
91. Printf ("day # % d: The longest nap starts at % 02d: % 02d and will last ",
92. Day, start. Hour, start. Minute );
93. If (last. Hour> 0) printf ("% d hours and", last. hour );
94. Printf ("% d minutes./N", last. Minute );
95. }
96. Return 0;
97. }
98.