hdu--4833--贪心

 1 #include <iostream>
 2 #include <cstring>
 3 using namespace std;
 4 
 5 const int size = 1510;
 6 int node[size+20];
 7 
 8 int main()
 9 {
10     int t , n , sth , stm , endh , endm , num , cnt , ans;
11     while( ~scanf( "%d",&t) )
12     {    
13         while( t-- )
14         {
15             ans = cnt = 0;
16             memset( node , 0 , sizeof(node) );
17             scanf( "%d",&n );
18             for( int i = 0 ; i< n ;i++ )
19             {
20                 scanf( "%d",&num );
21                 scanf( "%d:%d",&sth,&stm );
22                 scanf( "%d:%d",&endh,&endm );
23                 node[ sth*60+stm ] += num;
24                 node[ endh*60+endm ] -= num; 
25             }
26             for( int i = 0 ; i<=size ; i++ )
27             {
28                 cnt += node[i];
29                 ans = ans > cnt ? ans : cnt;
30             }    
31             printf( "%d\n",ans );
32         }
33     }
34     return 0;
35 }