bzoj 1067 分情况讨论

这道题考察人的严谨，各种情况分类讨论。

 #include <cstdio>
 #include <algorithm>
 #include <map>
 #define maxn 50010
 #define maxq 17
 #define P(i) (1<<(i))
 #define yes     0
 #define no         1
 #define maybe     2
 using namespace std;

 int n, q;
 int year[maxn];
 int st[maxn][maxq];

 int ind( int y ) {
     return (lower_bound( year+, year+n+, y ) - year);
 }
 void makest() {
     for( int q=; q<maxq; q++ )
         for( int i=; i<=(n-P(q)+); i++ )
             st[i][q] = max( st[i][q-], st[i+P(q-)][q-] );
 }
 int fmax( int lf, int rg ) {
     int len = rg-lf+;
     if( len<= ) return -;
     for( int q=maxq-; q>=; q-- )
         if( len>P(q) ) {
             return max( st[lf][q], st[rg-P(q)+][q] );
         } else if( len==P(q) ) {
             return st[lf][q];
         }
     return -;
 }
 int main() {
     scanf( "%d", &n );
     year[n+] = 0x7FFFFFFF;
     for( int i=; i<=n; i++ )
         scanf( "%d%d", year+i, &st[i][] );
     makest();
     sort( year+, year++n );
     scanf( "%d", &q );
     while( q-- ) {
         int a, b, ia, ib;
         scanf( "%d%d", &a, &b );
         ia = ind(a), ib = ind(b);
         if( year[ia]==a && year[ib]==b && b-a==ib-ia && st[ia][]>=st[ib][] && fmax(ia+,ib-)<st[ib][] ) {
             printf( "true\n" );
             continue;
         }
         if( year[ia]==a && year[ib]==b && b-a>ib-ia && st[ia][]>=st[ib][] && fmax(ia+(year[ia]==a),ib-)<st[ib][] ) {
             printf( "maybe\n" );
             continue;
         }
         if( ((year[ia]==a)^(year[ib]==b)) && fmax(ia+(year[ia]==a),ib-)< (year[ia]==a ? st[ia][] : st[ib][])  ) {
             printf( "maybe\n" );
             continue;
         }
         if( year[ia]!=a && year[ib]!=b ) {
             printf( "maybe\n" );
             continue;
         }
         printf( "false\n" );
     }
 }