传送门:【HDU】4883 TIANKENG’s restaurant
题目分析:传统的打标记法,区间满足左闭右开,那么左端点+x,右端点-x,最后扫一遍区间顺便取个最大值就行了。
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;
#define REP( i , a , b ) for ( int i = a ; i < b ; ++ i )
#define REV( i , a , b ) for ( int i = a - 1 ; i >= b ; -- i )
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FOV( i , a , b ) for ( int i = a ; i >= b ; -- i )
#define CLR( a , x ) memset ( a , x , sizeof a )
const int MAXN = 1445 ;
const int MAXE = 40005 ;
const int INF = 0x3f3f3f3f ;
int a[MAXN] ;
int n ;
void solve () {
int x , h , m , ans = 0 ;
CLR ( a , 0 ) ;
scanf ( "%d" , &n ) ;
while ( n -- ) {
scanf ( "%d%d:%d" , &x , &h , &m ) ;
a[h * 60 + m] += x ;
scanf ( "%d:%d" , &h , &m ) ;
a[h * 60 + m] -= x ;
}
x = 0 ;
FOR ( i , 0 , 1440 ) {
x += a[i] ;
if ( x > ans )
ans = x ;
}
printf ( "%d\n" , ans ) ;
}
int main () {
int T ;
scanf ( "%d" , &T ) ;
while ( T -- )
solve () ;
return 0 ;
}