poj_1083_Moving Tables

1.门的号必须进行转换，转换规则如下:奇数则n/2+1, 偶数 n/22.枚举区间去rst = max_val*10.#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define MAXN    201int rst[MAXN];int main(int argc, char const *argv[]){#ifndef ONLINE_JUDGE        freopen("test.in", "r", stdin);#endif        int cas, n, l, r, ans;        scanf("%d", &cas);        while( cas -- ) {                scanf("%d", &n); ans = 0;                memset(rst, 0, sizeof(rst));                for(int i = 1; i <= n; i ++) {                        scanf("%d %d", &l, &r);                        l = (l>>1)+((l&0x1)? 1 : 0); r = (r>>1)+((r&0x1)? 1 : 0);                        for(int i = min(l, r); i <= max(l, r); i ++) {                                rst[i] ++; ans = max(ans, rst[i]);                        }                }                printf("%d\n", (ans)*10);        }        return 0;}